id:A083706 - OEIS Search Results

Search: id:A083706

Displaying 1-1 of 1 results found.

page 1

2^(n+1)+n-1.

+0
6

1, 4, 9, 18, 35, 68, 133, 262, 519, 1032, 2057, 4106, 8203, 16396, 32781, 65550, 131087, 262160, 524305, 1048594, 2097171, 4194324, 8388629, 16777238, 33554455, 67108888, 134217753, 268435482, 536870939, 1073741852, 2147483677, 4294967326, 8589934623 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`Warning: not all quizzes permit the use of the OEIS!`
	LINKS	`C. P. Simoes, Teste de Desempenho Mental.`
	FORMULA	`G.f.: (1-2x^2)/((1-x)^2(1-2x)). a(n) = 2*a(n-1) + 3 - n.` `Row sums of A130301. - Gary W. Adamson (qntmpkt(AT)yahoo.com), May 20 2007`
	PROGRAM	`(PARI) a(n)=if(n<0, 0, 2^(n+1)+n-1)`
	CROSSREFS	`Cf. A130301.` `Adjacent sequences: A083703 A083704 A083705 this_sequence A083707 A083708 A083709` `Sequence in context: A038089 A027053 A122039 this_sequence A074896 A015713 A049198`
	KEYWORD	`nonn`
	AUTHOR	`njas, Jun 15 2003`

page 1

Search completed in 0.002 seconds

Last modified October 12 15:26 EDT 2008. Contains 144830 sequences.

AT&T Labs Research