A022442 - OEIS

This site is supported by donations to The OEIS Foundation.

A022442

a(n) = c(n) + c(n-1) where c is the sequence of numbers not in a.

2, 4, 8, 11, 13, 16, 19, 22, 26, 29, 32, 35, 38, 41, 44, 47, 49, 52, 55, 58, 61, 64, 67, 70, 73, 76, 79, 82, 85, 88, 91, 94, 98, 101, 104, 107, 110, 113, 116, 119, 122, 125, 128, 131, 134, 137 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,1`
	LINKS	`R. Stephan, Some divide-and-conquer sequences ...` `R. Stephan, Table of generating functions`
	FORMULA	`For n>0, a(n)=b(n) with b(0)=0, b(2n) = -b(n)+9n+3, b(2n+1) = -b(n)+9n+6-2[n==0]. - Ralf Stephan (ralf(AT)ark.in-berlin.de), Oct 23 2003`
	CROSSREFS	`Sequence in context: A116443 A078649 A161607 * A056689 A034037 A033153` `Adjacent sequences: A022439 A022440 A022441 * A022443 A022444 A022445`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 05:45 EST 2012. Contains 205694 sequences.