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!)
A023488 a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th number that is 1 or is not a Fibonacci number). 0

%I #12 Jun 05 2019 03:17:38

%S 4,9,14,20,30,44,66,101,158,248,393,627,1005,1616,2604,4203,6788,

%T 10970,17736,28683,46395,75053,121422,196448,317842,514261,832073,

%U 1346304,2178345,3524615,5702925,9227504,14930392,24157858,39088211

%N a(n) = b(n) + d(n), where b(n) = (n-th Fibonacci number > 2) and d(n) = (n-th number that is 1 or is not a Fibonacci number).

%F a(n) = A000045(n+4) + A001690(n) if n > 0. - _R. J. Mathar_, Feb 01 2019

%K nonn

%O 0,1

%A _Clark Kimberling_

%E a(27) onward corrected by _Sean A. Irvine_, Jun 04 2019

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 May 1 03:54 EDT 2024. Contains 372148 sequences. (Running on oeis4.)