Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049341 a(n+1) = sum of digits of a(n) + a(n-1). 4
3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3, 3, 6, 9, 6, 6, 3, 9, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
a(n+1) = A007953(a(n) + a(n-1)) for n > 0.
LINKS
FORMULA
Period 8.
EXAMPLE
After 6,9 we get 6+9 = 15 -> 1+5 = 6.
MATHEMATICA
LinearRecurrence[{0, 0, 0, 0, 0, 0, 0, 1}, {3, 6, 9, 6, 6, 3, 9, 3}, 112] (* Ray Chandler, Aug 27 2015 *)
PROG
(Haskell)
a049341 n = a030132_list !! n
a049341_list =
3 : 6 : map a007953 (zipWith (+) a049341_list $ tail a049341_list)
-- Reinhard Zumkeller, Aug 20 2011
CROSSREFS
Sequence in context: A019700 A151862 A067722 * A321943 A351189 A187082
KEYWORD
base,nonn,easy
AUTHOR
EXTENSIONS
Definition improved by Reinhard Zumkeller, Aug 20 2011
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 18 12:24 EDT 2024. Contains 375269 sequences. (Running on oeis4.)