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.

Showing 1-3 of 3 results.

A099383 Number of partitions of n into minimal numbers.

Original entry on oeis.org

1, 1, 2, 2, 4, 4, 7, 7, 11, 11, 16, 16, 24, 24, 33, 33, 46, 46, 62, 62, 82, 82, 106, 106, 138, 138, 174, 174, 220, 220, 274, 274, 339, 339, 414, 414, 507, 507, 611, 611, 737, 737, 881, 881, 1049, 1049, 1239, 1239, 1466, 1466, 1717, 1717, 2012, 2012, 2344, 2344
Offset: 0

Views

Author

Reinhard Zumkeller, Oct 14 2004

Keywords

Comments

A minimal number is the smallest number with a given number of divisors, see A007416;
a(2*n) = a(2*n+1) = A099385(n).

Examples

			a(8) = #{6+2, 6+1+1, 4+4, 4+2+2, 4+2+1+1, 4+1+1+1+1, 2+2+2+2,
2+2+2+1+1, 2+2+1+1+1+1, 2+1+1+1+1+1+1, 1+1+1+1+1+1+1+1} = 11.
		

Crossrefs

A099386 Number of partitions of 2*n into distinct minimal numbers.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 2, 1, 2, 3, 2, 3, 3, 2, 3, 3, 2, 3, 4, 3, 4, 5, 3, 4, 5, 3, 5, 6, 4, 6, 7, 5, 8, 9, 6, 9, 9, 6, 10, 10, 8, 12, 11, 9, 12, 11, 9, 12, 11, 9, 13, 12, 10, 14, 12, 10, 14, 12, 11, 15, 14, 13, 17, 16, 14, 18, 15, 13, 18, 15
Offset: 0

Views

Author

Reinhard Zumkeller, Oct 14 2004

Keywords

Comments

A minimal number is the smallest number with a given number of divisors, see A007416;
a(n) = A099384(2*n) = A099384(2*n+1).

Examples

			a(9) = A099384(18) = #{16+2, 12+6, 12+4+2} = 3.
		

Crossrefs

A099388 Number of partitions of the n-th minimal number into distinct minimal numbers.

Original entry on oeis.org

1, 1, 1, 2, 2, 2, 3, 4, 5, 7, 8, 14, 17, 21, 25, 39, 70, 142, 174, 227, 236, 272, 396, 584, 644, 1234, 3666, 5181, 6184, 9487, 15171, 23352, 25677, 45854, 50219, 56044, 82306, 160635, 220979, 456022, 837777, 1011781, 1072631, 3175263, 7915261, 8892354, 11746321
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 14 2004

Keywords

Comments

A minimal number is the smallest number with a given number of divisors, see A007416;

Examples

			a(6) = #{6, 4+2} = 2.
		

Crossrefs

Formula

a(n) = A099384(A007416(n)).

Extensions

Terms a(19) and beyond from Andrew Howroyd, Apr 20 2021
Showing 1-3 of 3 results.