login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A316211 Number of strict integer partitions of n into Fermi-Dirac primes. 3
1, 0, 1, 1, 1, 2, 1, 3, 1, 4, 2, 4, 4, 4, 6, 4, 9, 5, 10, 8, 11, 11, 12, 15, 13, 19, 16, 21, 21, 24, 26, 27, 32, 31, 37, 37, 42, 44, 47, 52, 53, 61, 61, 69, 71, 78, 82, 88, 95, 99, 108, 112, 122, 128, 137, 144, 154, 163, 172, 184, 193, 206, 216, 230, 242, 256 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,6
COMMENTS
A Fermi-Dirac prime (A050376) is a number of the form p^(2^k) where p is prime and k >= 0.
LINKS
FORMULA
O.g.f.: Product_d (1 + x^d) where the product is over all Fermi-Dirac primes (A050376).
EXAMPLE
The a(16) = 9 strict integer partitions of 16 into Fermi-Dirac primes:
(16),
(9,7), (11,5), (13,3),
(7,5,4), (9,4,3), (9,5,2), (11,3,2),
(7,4,3,2).
MATHEMATICA
nn=60;
FDpQ[n_]:=With[{f=FactorInteger[n]}, n>1&&Length[f]==1&&MatchQ[FactorInteger[2f[[1, 2]]], {{2, _}}]]
FDprimeList=Select[Range[nn], FDpQ];
ser=Product[1+x^d, {d, FDprimeList}];
Table[SeriesCoefficient[ser, {x, 0, n}], {n, 0, nn}]
CROSSREFS
Sequence in context: A117172 A029207 A111902 * A329480 A277895 A328772
KEYWORD
nonn
AUTHOR
Gus Wiseman, Jun 26 2018
STATUS
approved

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 December 3 22:01 EST 2023. Contains 367540 sequences. (Running on oeis4.)