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
4, 9, 14, 20, 30, 44, 66, 101, 158, 248, 393, 627, 1005, 1616, 2604, 4203, 6788, 10970, 17736, 28683, 46395, 75053, 121422, 196448, 317842, 514261, 832073, 1346304, 2178345, 3524615, 5702925, 9227504, 14930392, 24157858, 39088211 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
FORMULA
a(n) = A000045(n+4) + A001690(n) if n > 0. - R. J. Mathar, Feb 01 2019
CROSSREFS
Sequence in context: A313155 A347581 A348149 * A115585 A099980 A281314
KEYWORD
nonn
AUTHOR
EXTENSIONS
a(27) onward corrected by Sean A. Irvine, Jun 04 2019
STATUS
approved

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 April 17 23:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)