References to A115230

Let p = prime(n); a(n) = number of ways to write p = 2^i + q^j where i >= 0, j >= 1, q = odd prime.
1, 1, 2, 2, 3, 3, 3, 3, 2, 3, 3, 2, 3, 3, 2, 2, 2, 3, 2, 2, 3, 2, 4, 3, 2, 2, 2, 2, 2, 4, 1, 3, 3, 4


8 seqfan posts

Sun Apr 18 13:45:27 CEST 2010    [seqfan] Re: Sum of a binary power and an odd prime power
Sat Apr 17 15:48:42 CEST 2010    [seqfan] Re: Sum of a binary power and an odd prime power
Sat Apr 17 15:30:47 CEST 2010    [seqfan] Re: Sum of a binary power and an odd prime power
Fri Apr 16 16:35:01 CEST 2010    [seqfan] Re: Sum of a binary power and an odd prime power
Fri Apr 16 16:26:18 CEST 2010    [seqfan] Re: Sum of a binary power and an odd prime power
Fri Apr 16 13:26:16 CEST 2010    [seqfan] Re: Sum of a binary power and an odd prime power
Fri Apr 16 08:52:53 CEST 2010    [seqfan] Re: Sum of a binary power and an odd prime power
Fri Apr 16 08:48:03 CEST 2010    [seqfan] Sum of a binary power and an odd prime power

Index of A-numbers in seqfan: by ascending order    by month    by frequency    by keyword
Links to OEIS content are included according to The OEIS End-User License Agreement .