id:A010694 - OEIS Search Results

Search: id:A010694

Displaying 1-1 of 1 results found.

page 1

Period 2.

+0
2

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` `a(n)=2*A000034(n). G.f.: 2(1+2x)/((1-x)(1+x)). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 28 2008]` `Linear recurrence: a(0)=2, a(1)=4, a(n)=a(n-2) for n>=2 [From Jaume Oliver Lafont (joliverlafont(AT)gmail.com), Mar 20 2009]`
	PROGRAM	`(PARI) a(n)=2*(1+n%2) [From Jaume Oliver Lafont (joliverlafont(AT)gmail.com), Mar 20 2009]`
	CROSSREFS	`Sequence in context: A016095 A165464 A158137 this_sequence A111737 A056672 A037201` `Adjacent sequences: A010691 A010692 A010693 this_sequence A010695 A010696 A010697`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research