|
Search: id:A112661
|
|
|
| A112661 |
|
Sum of digits of previous 3 terms. |
|
+0
3
|
|
| 1, 1, 1, 3, 5, 9, 8, 4, 3, 6, 4, 4, 5, 4, 4, 4, 3, 2, 9, 5, 7, 3, 6, 7, 7, 2, 7, 7, 7, 3, 8, 2, 4, 5, 2, 2, 9, 4, 6, 10, 2, 9, 3, 5, 8, 7, 2, 8, 8, 9, 7, 6, 4, 8, 9, 3, 2, 5, 1, 8, 5, 5, 9, 10, 6, 7, 5, 9, 3, 8, 2, 5, 6, 4, 6, 7, 8, 3, 9, 3, 6, 9, 9, 6, 6, 3, 6, 6, 6, 9, 3, 9, 3, 6
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Sum of digits, not iterated (i.e. not digital sum, reducing to single digit) as we twice get a term of 10 which we do not reduce to 1. This is to tribonacci (A000073) as A030132 is to Fibonacci (A000045). This has a preamble of 77 terms, then enters a cycle of length 13 (starting 3, 9, 3). The cycle length of 13 is common, as when one starts with (3, 3, 3). Note that starting with (9,9,9) gives a cycle of length 1.
|
|
FORMULA
|
a(n+2) = sum of digits of (a(n) + a(n-1) + a(n-2)). a(n+2) = A007953(a(n) + a(n-1) + a(n-2)).
|
|
CROSSREFS
|
Cf. A000073, A004090, A007953, A010888, A030132.
Sequence in context: A029642 A079428 A094548 this_sequence A092996 A062949 A081500
Adjacent sequences: A112658 A112659 A112660 this_sequence A112662 A112663 A112664
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Jonathan Vos Post (jvospost2(AT)yahoo.com) and Andrew Carmichael Post (andrewpost(AT)gmail.com), Dec 29 2005
|
|
|
Search completed in 0.002 seconds
|
