cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A316220 Number of triangles whose weight is the n-th Fermi-Dirac prime in the multiorder of integer partitions of Fermi-Dirac primes into Fermi-Dirac primes.

Original entry on oeis.org

1, 1, 3, 3, 9, 21, 46, 95, 273, 363, 731, 3088, 6247, 24152, 46012, 319511, 1141923, 2138064, 7346404, 13530107, 45297804, 271446312
Offset: 1

Views

Author

Gus Wiseman, Jun 26 2018

Keywords

Comments

A Fermi-Dirac prime (A050376) is a number of the form p^(2^k) where p is prime and k >= 0. An FD-partition is an integer partition of a Fermi-Dirac prime into Fermi-Dirac primes. a(n) is the number of sequences of FD-partitions whose sums are weakly decreasing and sum to the n-th Fermi-Dirac prime.

Crossrefs

Programs

  • Mathematica
    nn=60;
    FDpQ[n_]:=With[{f=FactorInteger[n]},n>1&&Length[f]==1&&MatchQ[FactorInteger[2f[[1,2]]],{{2,_}}]];
    FDpl=Select[Range[nn],FDpQ];
    fen[n_]:=fen[n]=SeriesCoefficient[Product[1/(1-x^p),{p,Select[Range[n],FDpQ]}],{x,0,n}];
    Table[Sum[Times@@fen/@p,{p,Select[IntegerPartitions[FDpl[[n]]],And@@FDpQ/@#&]}],{n,Length[FDpl]}]