|
| |
|
|
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.
|
|
4
| |
|
|
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, 0, 2, 3, 1, 3, 3, 1, 4, 1, 1, 2, 4, 2, 1, 3, 3, 2, 1, 3, 1, 3, 2, 1, 3, 2, 2, 3, 4, 2, 1, 2, 2, 0, 1, 3, 2, 4, 2, 2, 0, 2, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 3, 3, 0, 2, 3, 2, 1, 1, 3, 1, 4
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
FORMULA
| a(n) = sum(A036987(k-1)*A000035(p-k)*A010055(p-k): 1<=k<p, p=prime(n)). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 29 2010]
|
|
|
EXAMPLE
| n=25: A000040(25) = 97 = 2^6+3*11 = 2^5+5*13 = 2^4+3^4 = 2^3+89^1 = 2^2+3*31 = 2^1+5*19 = 2^0+3*2^5, therefore a(25)=#{[16+81],[8+89]}=2.
|
|
|
MAPLE
| Contribution from Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 30 2010: (Start)
A000035 := proc(n) n mod 2 ; end proc:
A000108 := proc(n) binomial(2*n, n)/(n+1) ; end proc:
A036987 := proc(n) A000108(n) mod 2 ; end proc:
A010055 := proc(n) if n = 1 then 1; else numtheory[factorset](n) ; if nops(%) = 1 then 1; else 0; end if; end if: end proc:
A115230 := proc(n) p := ithprime(n) ; add(A036987(k-1)*A000035(p-k)*A010055(p-k), k=1..p-1) ; end proc: seq(A115230(n), n=1..40) ; # R. J. Mathar, Apr 30 2010 (End)
|
|
|
CROSSREFS
| Cf. A115231-A115233, A000079, A061345.
Sequence in context: A055778 A106482 A122462 * A165024 A157639 A010096
Adjacent sequences: A115227 A115228 A115229 * A115231 A115232 A115233
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 17 2006
|
|
|
EXTENSIONS
| Recomputed by Charles R Greathouse IV (charles.greathouse(AT)case.edu), Ray Chandler (rayjchandler(AT)sbcglobal.net), Richard Mathar (mathar(AT)strw.leidenuniv.nl), and Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 29 2010; thanks to Charles Greathouse, who pointed out that there were many errors in entries of A115230 - A115233.
Edited by N. J. A. Sloane, Apr 30 2010
Formula corrected, thanks to Richard Mathar who found an error in it Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 30 2010
|
| |
|
|
