login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A023483 a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 1) and d(n) = (n-th non-Fibonacci number). 1
6, 9, 12, 17, 23, 32, 46, 69, 104, 160, 250, 395, 629, 1007, 1619, 2607, 4205, 6790, 10972, 17738, 28685, 46397, 75055, 121424, 196450, 317844, 514264, 832076, 1346306, 2178347, 3524617, 5702927, 9227506, 14930394, 24157860, 39088213 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..36.

FORMULA

a(n) = A000045(n+2)+A001690(n). - R. J. Mathar, Feb 01 2019

MATHEMATICA

nn = 36; b = Table[Fibonacci[n + 2], {n, nn}]; d = Take[Complement[Range[2, 2*nn], b], nn]; b + d (* T. D. Noe, Mar 09 2011 *)

fibs=Select[Fibonacci[Range[60]], #>1&]; nonfibs=Take[Complement[Range[4, 75], fibs], Length[fibs]]; Total/@Thread[{fibs, nonfibs}]  (* Harvey P. Dale, Mar 10 2011 *)

CROSSREFS

Sequence in context: A084806 A020938 A136360 * A023042 A128245 A117714

Adjacent sequences:  A023480 A023481 A023482 * A023484 A023485 A023486

KEYWORD

nonn

AUTHOR

Clark Kimberling.

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 15 17:03 EST 2019. Contains 330000 sequences. (Running on oeis4.)