login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A237343 For k in {2,3,...,9} define a sequence as follows: a(0)=0; for n>=0, a(n+1)=a(n)+1, unless a(n) ends in k, in which case a(n+1) is obtained by replacing the last digit of a(n) with the digit(s) of k^2. This is k(6). 1
0, 1, 2, 3, 4, 5, 6, 36, 336, 3336, 33336, 333336, 3333336, 33333336, 333333336, 3333333336, 33333333336, 333333333336, 3333333333336, 33333333333336, 333333333333336, 3333333333333336, 33333333333333336, 333333333333333336, 3333333333333333336 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
G.f.: (20*x^7-9*x^6-9*x^5-9*x^4-9*x^3-9*x^2+x)/(10*x^2-11*x+1). - Alois P. Heinz, Feb 07 2014
a(n) = ( 8 + 10^(n-5) )/3 for n>5. [Bruno Berselli, Feb 08 2014]
MATHEMATICA
Join[Range[0, 5], Table[(8 + 10^(n - 5))/3, {n, 6, 30}]] (* Bruno Berselli, Feb 08 2014 *)
CROSSREFS
Sequence in context: A004846 A178579 A347308 * A300856 A173575 A024641
KEYWORD
nonn,base,easy
AUTHOR
Vincenzo Librandi, Feb 06 2014
EXTENSIONS
Definition by N. J. A. Sloane, Feb 07 2014
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 14:10 EDT 2024. Contains 371792 sequences. (Running on oeis4.)