This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A126616 a(n) = n for n < 10, a(10*n) = a(n), and if the terms a(10), a(20), a(30), ... are deleted, one gets back the original sequence. 8
 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 2, 1, 3, 2, 1, 3, 2, 1, 3, 4, 2, 1, 3, 4, 2, 1, 3, 4, 2, 5, 1, 3, 4, 2, 5, 1, 3, 4, 2, 6, 5, 1, 3, 4, 2, 6, 5, 1, 3, 7, 4, 2, 6, 5, 1, 3, 7, 4, 2, 8, 6, 5, 1, 3, 7, 4, 2, 8, 6, 9, 5, 1, 3, 7, 4, 2, 8, 6, 9, 1, 5, 1, 3, 7, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A self-generating sequence. Invented by Eric Angelini. Might also be called a lizard sequence (une suite du lézard) because it grows back from its tail. REFERENCES J.-P. Delahaye, La suite du lézard et autres inventions, Pour la Science, No. 353, 2007. LINKS MAPLE A126616 := proc(n) option remember ; if n < 10 then n ; elif n mod 10 = 0 then A126616(n/10) ; else A126616( n-floor(n/10) ) ; fi ; end: seq(A126616(n), n=1..120) ; # R. J. Mathar, Oct 02 2007 PROG (PARI) a(n, m=10)=while(n>=m, if(n%m, n-=n\m, n\=m)); n \\ M. F. Hasler, Mar 07 2015 CROSSREFS Cf. A117943, A178931, A255824 - A255829. Sequence in context: A133500 A256229 A052423 * A121042 A000030 A179635 Adjacent sequences:  A126613 A126614 A126615 * A126617 A126618 A126619 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, Feb 09 2007 EXTENSIONS More terms from R. J. Mathar, Oct 02 2007 Definition rephrased by M. F. Hasler, Mar 09 2015 STATUS approved

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

Last modified October 23 19:37 EDT 2019. Contains 328373 sequences. (Running on oeis4.)