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.

Previous Showing 11-12 of 12 results.

A275029 Partition numbers (A000041) congruent to 2 (mod 4).

Original entry on oeis.org

2, 22, 30, 42, 490, 1002, 1958, 3010, 3718, 6842, 12310, 37338, 53174, 89134, 105558, 124754, 204226, 614154, 1741630, 2012558, 13848650, 34262962, 133230930, 214481126, 271248950, 607163746, 4835271870, 30388671978, 45060624582, 88751778802, 107438159466
Offset: 1

Views

Author

Colin Barker, Nov 13 2016

Keywords

Comments

Partition numbers having the same number of even divisors as odd divisors.
The corresponding indices are in A237280.
The intersection of A000041 and A016825.

Examples

			30 is in the sequence because it is a partition number, and its divisors are [1,2,3,5,6,10,15,30].
		

Crossrefs

Programs

  • Maple
    select(t -> t mod 4 = 2, map(combinat:-numbpart, [$1..500])); # Robert Israel, Nov 14 2016
  • Mathematica
    Select[PartitionsP@ Range@ 160, Mod[#, 4] == 2 &] (* Michael De Vlieger, Nov 15 2016 *)
  • PARI
    a000041(n) = numbpart(n)
    terms(n) = my(i=0, k=2); while(1, if(Mod(a000041(k), 4)==2, print1(a000041(k), ", "); i++); if(i==n, break); k++)
    /* Print initial 50 terms as follows */
    terms(50) \\ Felix Fröhlich, Nov 15 2016

A235704 a(n) is the smallest number k such that n*k is a partition number.

Original entry on oeis.org

1, 1, 1, 14, 1, 5, 1, 7, 15, 3, 1, 66, 286, 3, 1, 11, 22715, 44, 33, 35761, 2, 1, 363, 33, 63, 143, 5, 2, 84, 1, 2425, 72610, 7, 2725580, 11, 22, 926026, 3283, 123981330, 58088, 363, 1, 70, 4, 3, 176484, 11209, 85166, 10, 141790, 11209835405
Offset: 1

Views

Author

Omar E. Pol, Jan 14 2014

Keywords

Examples

			For n = 4, a(4) = 14 because if 1 <= k <= 13 we have that 4*k is not a partition number, but if k = 14 then 4*14 = 56 and 56 is the number of partitions of 11.
		

Crossrefs

Programs

  • Mathematica
    a[n_] := PartitionsP[NestWhile[(# + 1)&, 1, Mod[PartitionsP@ #, n] > 0 &]]/n; Array[a,51] (* Giovanni Resta, Jan 15 2014 *)

Formula

a(n) = 1 iff n is a partition number.
a(n) = A072871(n)/n.
Previous Showing 11-12 of 12 results.