|
Search: id:A130833
|
|
|
| A130833 |
|
Diginacci numbers : d(n)=s(d(n-2)+d(n-1)) where s(p)=sum of digits of p. |
|
+0
1
|
|
| 1, 1, 2, 3, 5, 8, 4, 3, 7, 1, 8, 9, 8, 8, 7, 6, 4, 1, 5, 6, 2, 8, 1, 9, 1, 1, 2, 3, 5, 8, 4, 3, 7, 1, 8, 9, 8, 8, 7, 6, 4, 1, 5, 6, 2, 8, 1, 9, 1, 1, 2, 3, 5, 8, 4, 3, 7, 1, 8, 9, 8, 8, 7, 6, 4, 1, 5, 6, 2, 8, 1, 9, 1, 1, 2, 3, 5, 8, 4, 3, 7, 1, 8, 9, 8, 8, 7, 6, 4, 1, 5, 6, 2, 8, 1, 9, 1, 1, 2, 3, 5, 8, 4, 3, 7, 1, 8, 9, 8, 8, 7, 6, 4, 1, 5, 6, 2, 8, 1, 9, 1, 1, 2, 3, 5, 8, 4, 3, 7, 1, 8, 9, 8, 8, 7, 6, 4, 1, 5, 6, 2, 8, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
The 24 first terms of the sequence constitute a loop indefinitely repeated.
The same procedure starting from d(1)=2, d(2)=1 (lucas numbers) gives a loop of also 24 terms : 2,1,3,4,7,2,9,2,2,4,6,1,7,8,6,5,2,7,9,7,7,5,3,8
Equals A030132 without the first term. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 13 2008
|
|
FORMULA
|
d(n+24)=d(n).
|
|
EXAMPLE
|
1+1=2 1+2=3 2+3=5 3+5=8 5+8=13=1+3=4, then d(7)=4
|
|
CROSSREFS
|
Cf. A000045.
Sequence in context: A007887 A105472 A030132 this_sequence A004090 A104205 A021428
Adjacent sequences: A130830 A130831 A130832 this_sequence A130834 A130835 A130836
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
Philippe Lallouet (philip.lallouet(AT)wanadoo.fr), Aug 20 2007
|
|
|
Search completed in 0.002 seconds
|
