OFFSET
0,1
COMMENTS
For n>=1, when the Collatz map A006370 is applied to a(n) for n-1 steps, the least significant digit will cycle from 8 to 9 back to 8 exactly n-1 times before turning into a 4, and each term is the smallest number that fits such criteria. For a(3) = 38 we get 38 -> 19 (1st 9) -> 58 -> 29 (2nd 9) -> 88 -> 44 (no 9). - Nikolas Grosland, Jun 14 2026
LINKS
Stefano Spezia, Table of n, a(n) for n = 0..3300
Index entries for linear recurrences with constant coefficients, signature (3,-2).
FORMULA
a(n) = A118654(n, 5).
a(n) = 2*(a(n-1)+1) with a(0)=3. - Vincenzo Librandi, Aug 06 2010
G.f.: ( 3-x ) / ( (2*x-1)*(x-1) ). - R. J. Mathar, Mar 23 2023
E.g.f.: exp(x)*(5*exp(x) - 2). - Stefano Spezia, Oct 03 2023
EXAMPLE
a(4) = 5*2^4 - 2 = 80 - 2 = 78.
MATHEMATICA
LinearRecurrence[{3, -2}, {3, 8}, 30] (* Ray Chandler, Jul 18 2020 *)
PROG
(PARI) a(n) = 5<<n-2; \\ Bruce Nye, Jun 24 2026
CROSSREFS
KEYWORD
easy,nonn,changed
AUTHOR
STATUS
approved
