This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A161995 a(n) represents the minimum number k, not already present in the sequence, whose digit sum is equal to the digital root of Sum_{j=0..n-1} a(j), with a(0)=0 and a(1)=1. 0
 0, 1, 10, 2, 4, 8, 7, 5, 100, 11, 13, 17, 16, 14, 1000, 20, 22, 26, 25, 23, 10000, 101, 31, 35, 34, 32, 100000, 110, 40, 44, 43, 41, 1000000, 200, 103, 53, 52, 50, 10000000, 1001, 112, 62, 61, 104, 100000000, 1010, 121, 71, 70, 113, 1000000000, 1100, 130, 80, 106 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS From a(3) onward the digital root is periodic with period length equal to six: 1,2,4,8,7,5. LINKS EXAMPLE a(3) = 10 because a(0) + a(1) = 1 and 10 is the minimum number greater than 1 whose digit sum is equal to 1. CROSSREFS Cf. A010888. Sequence in context: A049296 A220468 A169851 * A069036 A155817 A299980 Adjacent sequences:  A161992 A161993 A161994 * A161996 A161997 A161998 KEYWORD easy,nonn,base AUTHOR Paolo P. Lava & Giorgio Balzarotti, Jun 24 2009 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 June 16 06:46 EDT 2019. Contains 324145 sequences. (Running on oeis4.)