OFFSET
0,3
COMMENTS
Numbers a(n) = k such that the number m with n 5's and k 1's has digit product = digit sum = 5^n.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (7,-11,5).
FORMULA
a(n) = 7*a(n-1) - 11*a(n-2) + 5*a(n-3), n >= 3. - Vincenzo Librandi, Oct 26 2011
G.f.: (-1-26*x^2+7*x)/((5*x-1)*(x-1)^2). - R. J. Mathar, Oct 26 2011
E.g.f.: exp(x)*(exp(4*x) - 5*x). - Elmo R. Oliveira, Sep 10 2024
EXAMPLE
Corresponding numbers m are 1, 5, 11111111111111155, ...
MATHEMATICA
Table[5^m-5*m, {m, 0, 10}]
LinearRecurrence[{7, -11, 5}, {1, 0, 15}, 30] (* Harvey P. Dale, Oct 21 2015 *)
PROG
(Magma) [(5^n - 5*n): n in [0..25]]; // Vincenzo Librandi, Dec 16 2010
(PARI) a(n)=5^n-5*n \\ Charles R Greathouse IV, Oct 26 2011
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Zak Seidov, May 16 2005
EXTENSIONS
Corrected by Charles R Greathouse IV, Sep 08 2012
STATUS
approved