id:A111108 - OEIS Search Results

Search: id:A111108

Displaying 1-1 of 1 results found.

page 1

a(n) = A001333(n) - (-2)^(n-1), n > 0.

+0
1

0, 5, 3, 25, 25, 131, 175, 705, 1137, 3875, 7095, 21649, 43225, 122435, 259423, 698625, 1541985, 4011971, 9107175, 23143825, 53559817, 133933475, 314086735, 776787009, 1838300625, 4512108515, 10745077143, 26237143825, 62749602745 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Conjecture: for odd primes p, p divides a(p). Note that (a(n)) and A001333 have different offsets.` `The conjecture follows from the formula A001333(n) = ((1-sqrt(2))^n + (1+sqrt(2))^n)/2. - Max Alekseyev (maxale(AT)gmail.com), Oct 16 2005`
	CROSSREFS	`Cf. A001333, A000204.` `Sequence in context: A083756 A146317 A032532 this_sequence A038245 A027858 A124013` `Adjacent sequences: A111105 A111106 A111107 this_sequence A111109 A111110 A111111`
	KEYWORD	`easy,nonn`
	AUTHOR	`Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Oct 14 2005`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research