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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081410 a(1)=a(2)=1; a(n)=a(n-1)+a(n-2) + n (mod 3). 1
1, 1, 2, 4, 8, 12, 21, 35, 56, 92, 150, 242, 393, 637, 1030, 1668, 2700, 4368, 7069, 11439, 18508, 29948, 48458, 78406, 126865, 205273, 332138, 537412, 869552, 1406964, 2276517, 3683483, 5960000, 9643484, 15603486, 25246970, 40850457 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

FORMULA

a(n)=floor(C*F(n))+b(n) where C=(9-sqrt(5))/4, F(n) is the n-th Fibonacci number and b(n) is the 6-periodic sequence (0, 0, -1, -1, 0, -1)

G.f.: (2x^4+1) / [(1-x^3)(1-x-x^2)].

CROSSREFS

Cf. A004695.

Sequence in context: A131770 A163489 A076651 * A027677 A103787 A032473

Adjacent sequences:  A081407 A081408 A081409 * A081411 A081412 A081413

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 20 2003

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 17 06:27 EST 2012. Contains 205998 sequences.