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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A011369 a(n+1)=a(n)-F(n) if >0, else a(n)+F(n), where F() are Fibonacci numbers. 0
0, 0, 1, 2, 4, 1, 6, 14, 1, 22, 56, 1, 90, 234, 1, 378, 988, 1, 1598, 4182, 1, 6766, 17712, 1, 28658, 75026, 1, 121394, 317812, 1, 514230, 1346270, 1, 2178310, 5702888, 1, 9227466, 24157818, 1, 39088170, 102334156, 1, 165580142, 433494438, 1, 701408734 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

FORMULA

a(n) = 0, if n = 0; F(n-1)+1, if n == 0 (mod 3); F(n)+1, if n == 1 (mod 3): 1, if n == 2 (mod 3) (David W. Wilson).

CROSSREFS

Sequence in context: A080032 A105357 A167546 * A110877 A204115 A204130

Adjacent sequences:  A011366 A011367 A011368 * A011370 A011371 A011372

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 February 16 02:51 EST 2012. Contains 205860 sequences.