This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A078412 a(0) = 5, a(1) = 8; for n >1, a(n)=(a(n-1)+a(n-2))/3^n, where 3^n is the highest power of 3 dividing a(n-1)+a(n-2). 4
 5, 8, 13, 7, 20, 1, 7, 8, 5, 13, 2, 5, 7, 4, 11, 5, 16, 7, 23, 10, 11, 7, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Index entries for linear recurrences with constant coefficients, signature (0, 0, 1). FORMULA a(3n-1)=2, a(3n)=1, a(3n+1)=1 for n>=8. - Sascha Kurz, Jan 04 2003 MATHEMATICA Join[{5, 8, 13, 7, 20, 1, 7, 8, 5, 13, 2, 5, 7, 4, 11, 5, 16, 7, 23, 10, 11, 7}, LinearRecurrence[{0, 0, 1}, {2, 1, 1}, 79]] (* Ray Chandler, Aug 25 2015 *) CROSSREFS Cf. A000045, A078414. Sequence in context: A185729 A164128 A259912 * A144650 A046038 A070127 Adjacent sequences:  A078409 A078410 A078411 * A078413 A078414 A078415 KEYWORD nonn,easy AUTHOR Yasutoshi Kohmoto, Dec 28, 2002 EXTENSIONS More terms from Sascha Kurz, Jan 04 2003 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 July 17 08:39 EDT 2019. Contains 325095 sequences. (Running on oeis4.)