id:A062306 - OEIS Search Results

Search: id:A062306

Displaying 1-1 of 1 results found.

page 1

Number of ways writing 2^n as a sum of two nonprime numbers.

+0
1

1, 0, 1, 4, 7, 19, 36, 82, 170, 362, 740, 1537, 3144, 6443, 13116, 26661, 54034, 109386, 221121, 446502, 900436, 1814910, 3655069, 7356483, 14796994, 29750473, 59789057 (list; graph; listen)

	OFFSET	`1,4`
	FORMULA	`a(n)=A062610(2^n) = number of nonprime+nonprime partitions of 2^n.`
	EXAMPLE	`n = 5: 2^5 = 32 = 4+28 = 6+26 = 8+24 = 10+22 = 12+20 = 14+18 = 16+16, so a(5) = 7.`
	CROSSREFS	`Cf. A061358, A062602, A062610.` `Sequence in context: A024824 A006381 A102991 this_sequence A140167 A006130 A133264` `Adjacent sequences: A062303 A062304 A062305 this_sequence A062307 A062308 A062309`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Jul 05 2001`
	EXTENSIONS	`More terms from Dean Hickerson, Jul 23, 2001`

page 1

Search completed in 0.002 seconds

Last modified September 6 00:03 EDT 2008. Contains 143485 sequences.

AT&T Labs Research