This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A023489 a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th number that is 1 or is not a Fibonacci number). 0
 5, 11, 17, 25, 38, 57, 87, 135, 213, 337, 537, 860, 1382, 2226, 3591, 5800, 9372, 15151, 24501, 39629, 64106, 103710, 167790, 271473, 439235, 710679, 1149884, 1860533, 3010385, 4870884, 7881234, 12752082, 20633279, 33385323, 54018563, 87403846, 141422368 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA a(n) = phi^(n+2) + n + log_phi(n) + O(1). [Charles R Greathouse IV, Jan 17 2012] MATHEMATICA nn=50; With[{ln=LucasL[Range[3, nn+2]], dn=Take[Join[{1}, Complement[ Range[2nn], Fibonacci[Range[2nn]]]], nn]}, Total/@Thread[{ln, dn}]] (* From Harvey P. Dale, Jan 17 2012 *) PROG (PARI) b(n)=fibonacci(n+1)+fibonacci(n+3) d(n)=my(k=2); n-=3; while(fibonacci(k++)<=n+k, ); n+k a(n)=b(n)+d(n) \\ Charles R Greathouse IV, Jan 17 2012 CROSSREFS Sequence in context: A214912 A216551 A089110 * A108294 A046869 A028388 Adjacent sequences:  A023486 A023487 A023488 * A023490 A023491 A023492 KEYWORD nonn,changed AUTHOR EXTENSIONS a(28)-a(37) corrected by Harvey P. Dale, Jan 17 2012 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 .

Last modified May 25 05:52 EDT 2013. Contains 225644 sequences.