login
The OEIS is supported by the many generous donors 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

%I #9 Mar 25 2023 22:57:04

%S 1,0,1,4,7,19,36,82,170,362,740,1537,3144,6443,13116,26661,54034,

%T 109386,221121,446502,900436,1814910,3655069,7356483,14796994,

%U 29750473,59789057,120112121,241218391,484287995,972034297,1950544851

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

%F a(n)=A062610(2^n) = number of nonprime+nonprime partitions of 2^n.

%e n = 5: 2^5 = 32 = 4+28 = 6+26 = 8+24 = 10+22 = 12+20 = 14+18 = 16+16, so a(5) = 7.

%Y Cf. A061358, A062602, A062610.

%K nonn,more

%O 1,4

%A _Labos Elemer_, Jul 05 2001

%E More terms from _Dean Hickerson_, Jul 23, 2001

%E a(28)-a(32) from _Sean A. Irvine_, Mar 25 2023

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 5 08:55 EDT 2024. Contains 372263 sequences. (Running on oeis4.)