This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A174429 Collatz-Fibonacci numbers: F(1)=F(2)=1; if n>2, F(n)=F(C(n))+F(C(C(n))), where C(n)=A006370(n) 1
 1, 1, 21, 2, 8, 34, 1597, 3, 6765, 13, 610, 55, 55, 2584, 2584, 5, 233, 10946, 10946, 21, 21, 987, 987, 89, 46368, 89, 114059301025943970552219, 4181, 4181, 4181, 10284720757613717413913, 8, 196418, 377, 377, 17711, 17711, 17711, 9227465, 34 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS _Reinhard Zumkeller_, Table of n, a(n) for n = 1..10000 Sam Alexander, Collatz Recursion FORMULA a(n) = Fibonacci(A008908(n)) = A000045(A008908(n)). - T. D. Noe, Jul 06 2010 MATHEMATICA c[n_]:=If[EvenQ[n], n/2, 3n+1]; f[1]=1; f[2]=1; f[n_]:=f[n]=f[c[n]]+f[c[c[n]]]; Table[f[n], {n, 100}] [From T. D. Noe, Jul 06 2010] PROG (Haskell) a174429 = a000045 . a008908  -- [Reinhard Zumkeller, Nov 10 2011] CROSSREFS Sequence in context: A040436 A040438 A040439 * A108718 A083122 A040440 Adjacent sequences:  A174426 A174427 A174428 * A174430 A174431 A174432 KEYWORD nonn,nice AUTHOR Sam Alexander, Mar 19 2010 EXTENSIONS Corrected by T. D. Noe, Jul 06 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .