This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A112661 Sum of digits of sum of previous 3 terms. 2
 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, 9, 2, 10, 3, 6, 10, 10, 8, 10, 10, 10, 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, 9, 2, 10, 3, 6, 10, 10, 8, 10, 10, 10, 3, 5, 9, 8, 4, 3, 6, 4, 4, 5, 4, 4, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS 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 sequence has a preamble of 3 terms (1, 1, 1), then enters a cycle of length 39 (ending with 10, 10, 10). LINKS 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)). MATHEMATICA a[0] = a[1] = a[2] = 1; a[n_] := a[n] = Total@ IntegerDigits[a[n-1] + a[n-2] + a[n-3]]; a /@ Range[0, 93] (* Giovanni Resta, Jun 17 2016 *) CROSSREFS Cf. A000073, A004090, A007953, A010888, A030132. Sequence in context: A221967 A079428 A094548 * A230725 A254689 A176445 Adjacent sequences:  A112658 A112659 A112660 * A112662 A112663 A112664 KEYWORD base,easy,nonn AUTHOR Jonathan Vos Post and Andrew Carmichael Post (andrewpost(AT)gmail.com), Dec 29 2005 EXTENSIONS Data and name corrected by Giovanni Resta, Jun 17 2016 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 03:44 EDT 2019. Contains 324145 sequences. (Running on oeis4.)