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.

A278201 Partition numbers (A000041) of the form 2^7 * k for odd k.

Original entry on oeis.org

541946240, 47826239745920, 49760750604354432757376, 18426207875324210441995136, 914345304752746677204951178080640, 377394877138559089794329589034333523822720, 33381228189530831120385246576357623531476650368, 23951815370456759593096244705083096637451017834880
Offset: 1

Views

Author

Colin Barker, Nov 15 2016

Keywords

Comments

Also partition numbers having seven times as many even divisors as odd divisors.

Crossrefs

Programs

  • Mathematica
    Select[PartitionsP@ Range@ 2000, Count[#, k_ /; EvenQ@ k] == 7 Count[#, k_ /; OddQ@ k] &@ Divisors@ # &] (* Michael De Vlieger, Nov 15 2016 *)
  • PARI
    maxk=3000; L=List(); for(k=1, maxk, p=numbpart(k); if(p%2^7==0 & p\2^7%2==1, listput(L, p))); Vec(L)