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
%I A161995
%S A161995 0,1,10,2,4,8,7,5,100,11,13,17,16,14,1000,20,22,26,25,23,10000,101,31,
%T A161995 35,34,32,100000,110,40,44,43,41,1000000,200,103,53,52,50,10000000,1001,
%U A161995 112,62,61,104,100000000,1010,121,71,70,113,1000000000,1100,130,80,106
%N 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.
%C A161995 From a(3) onward the digital root is periodic with period length equal 
               to six: 1,2,4,8,7,5.
%e A161995 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.
%Y A161995 A010888
%Y A161995 Sequence in context: A010175 A160136 A049296 this_sequence A069036 A155817 
               A037922
%Y A161995 Adjacent sequences: A161992 A161993 A161994 this_sequence A161996 A161997 
               A161998
%K A161995 easy,nonn,uned
%O A161995 0,3
%A A161995 Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Jun 24 2009

    
page 1

Search completed in 0.002 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 4 08:07 EST 2009. Contains 170310 sequences.


AT&T Labs Research