id:A011369 - OEIS Search Results

Search: id:A011369

Displaying 1-1 of 1 results found.

page 1

a(n+1)=a(n)-F(n) if >0, else a(n)+F(n), where F() are Fibonacci numbers.

+0
1

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; listen)

	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 this_sequence A110877 A021009 A137478` `Adjacent sequences: A011366 A011367 A011368 this_sequence A011370 A011371 A011372`
	KEYWORD	`nonn,easy`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

page 1

Search completed in 0.002 seconds

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.

AT&T Labs Research