id:A084964 - OEIS Search Results

Search: id:A084964

Displaying 1-1 of 1 results found.

page 1

Follow n by n-2. Also solution of a(n+2)=a(n)+1, a(0)=2, a(1)=0.

+0
7

2, 0, 3, 1, 4, 2, 5, 3, 6, 4, 7, 5, 8, 6, 9, 7, 10, 8, 11, 9, 12, 10, 13, 11, 14, 12, 15, 13, 16, 14, 17, 15, 18, 16, 19, 17, 20, 18, 21, 19, 22, 20, 23, 21, 24, 22, 25, 23, 26, 24, 27, 25, 28, 26, 29, 27, 30, 28, 31, 29, 32, 30, 33, 31, 34, 32, 35, 33, 36, 34, 37, 35, 38, 36, 39 (list; graph; listen)

	OFFSET	`0,1`
	FORMULA	`G.f.: (2-2x+x^2)/((1-x)(1-x^2)). a(2n+1)=n. a(2n)=n+2. a(n+2)=a(n)+1. a(n)=-a(-3-n).` `a(n) = floor(n/2) + 1 + (-1)^n. - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Aug 27 2005` `A112032(n)=2^a(n); A112033(n)=3*2^a(n); a(n)=A109613(n+2)-A052938(n). - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Aug 27 2005`
	PROGRAM	`(PARI) a(n)=n\2-2*(n%2)+2`
	CROSSREFS	`Cf. A030451.` `Cf. A097065.` `Sequence in context: A025636 A025637 A097065 this_sequence A008720 A008734 A053445` `Adjacent sequences: A084961 A084962 A084963 this_sequence A084965 A084966 A084967`
	KEYWORD	`nonn`
	AUTHOR	`Michael Somos, Jun 15 2003`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research