id:A010694 - OEIS Search Results

Search: id:A010694

Displaying 1-1 of 1 results found.

page 1

Period 2.

+0
1

2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2, 4, 2 (list; graph; listen)

	OFFSET	`0,1`
	LINKS	`INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 1073`
	FORMULA	`a(n)=(-1)^(n+1)+3 a(n)=4(n mod 2)+2[(n+1) mod 2] - Paolo P. Lava (ppl(AT)spl.at), Oct 20 2006`
	CROSSREFS	`Sequence in context: A093056 A134400 A016095 this_sequence A111737 A056672 A037201` `Adjacent sequences: A010691 A010692 A010693 this_sequence A010695 A010696 A010697`
	KEYWORD	`nonn`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research