login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062306 Number of ways writing 2^n as a sum of two nonprime numbers. 0
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; refs; listen; history; internal format)
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: A174465 A006381 A102991 * A140167 A006130 A182646

Adjacent sequences:  A062303 A062304 A062305 * 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 14 13:08 EST 2012. Contains 205623 sequences.