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.

A300271 Smallest Heinz number of a partition obtained from y by removing one square from its Young diagram, where y is the integer partition with Heinz number n > 1.

Original entry on oeis.org

1, 2, 2, 3, 3, 5, 4, 6, 5, 7, 6, 11, 7, 9, 8, 13, 9, 17, 10, 14, 11, 19, 12, 15, 13, 18, 14, 23, 15, 29, 16, 21, 17, 21, 18, 31, 19, 26, 20, 37, 21, 41, 22, 27, 23, 43, 24, 35, 25, 34, 26, 47, 27, 33, 28, 38, 29, 53, 30, 59, 31, 42, 32, 39, 33, 61, 34, 46
Offset: 2

Views

Author

Gus Wiseman, Mar 01 2018

Keywords

Comments

The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).

Crossrefs

Programs

  • Mathematica
    dip[n_]:=Min@@Table[n/q*If[q===2,1,NextPrime[q,-1]],{q,Select[Divisors[n],PrimeQ]}];
    Table[dip[n],{n,2,50}]