Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A161995
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A161995 a(n) represents the minimum number k, not already present in the sequence, whose digits sum is equal to the digital root of Sum{j=0..n-1}{a(j)}, with a(0)=0 and a(1)=1. +0
1
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; listen)
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research