OFFSET
1,1
COMMENTS
These numbers also have many palindromic divisors. - Jason Earls, Nov 28 2009
REFERENCES
Jason Earls, "Palindions," Mathematical Bliss, Pleroma Publications, 2009, pages 115-120. ASIN: B002ACVZ6O.
LINKS
Paolo Xausa, Table of n, a(n) for n = 1..990
Index entries for linear recurrences with constant coefficients, signature (11,-10).
FORMULA
If n>1 then a(n) = (2*10^n - 20)/15. - Robert Gerbicz, Sep 06 2002
From Elmo R. Oliveira, Jul 21 2025: (Start)
G.f.: 2*x*(1 - 5*x + 10*x^2)/((1-x)*(1-10*x)).
E.g.f.: 2*(9 + 15*x - 10*exp(x) + exp(10*x))/15.
a(n) = 2*A073548(n).
a(n) = 11*a(n-1) - 10*a(n-2) for n >= 4. (End)
EXAMPLE
a(2) = 12 because there are 12 Fibonacci numbers up to 10^2 which end in 3.
MATHEMATICA
LinearRecurrence[{11, -10}, {2, 12, 132}, 25] (* Paolo Xausa, Aug 27 2025 *)
CROSSREFS
KEYWORD
base,nonn,easy
AUTHOR
Shyam Sunder Gupta, Aug 15 2002
EXTENSIONS
More terms from Robert Gerbicz, Sep 06 2002
STATUS
approved