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.

A109968 Number of partitions of n into decimal repdigits of distinct digits.

Original entry on oeis.org

1, 1, 1, 2, 2, 3, 4, 5, 6, 8, 9, 11, 12, 14, 16, 18, 20, 21, 24, 24, 27, 27, 30, 30, 30, 31, 32, 32, 31, 32, 31, 32, 29, 31, 29, 30, 28, 28, 28, 27, 29, 27, 28, 26, 30, 28, 30, 29, 30, 30, 31, 31, 32, 35, 31, 38, 33, 35, 34, 36, 38, 39, 38, 37, 39, 38, 43, 40, 44, 42, 44, 43, 44, 44
Offset: 0

Views

Author

Reinhard Zumkeller, Jul 06 2005

Keywords

Comments

a(n) <= A109950(n) <= A000009(n);
A109969(n) = a(n+1) - a(n);
all partitions have no more than 9 parts.

Examples

			a(60)=38: 60 = 55+4+1 = 55+3+2 = 44+11+5 = 44+11+3+2 =
44+9+7 = 44+9+6+1 = 44+9+5+2 = 44+8+7+1 = 44+8+6+2 =
44+8+5+3 = 44+8+5+2+1 = 44+7+6+3 = 44+7+6+2+1 = 44+7+5+3+1 =
44+6+5+3+2 = 33+22+5 = 33+22+4+1 = 33+11+9+7 = 33+11+9+5+2 =
33+11+8+6+2 = 33+11+7+5+4 = 33+9+8+7+2+1 = 33+9+8+6+4 =
33+9+8+5+4+1 = 33+9+7+6+5 = 33+9+7+6+4+1 = 33+9+7+5+4+2 =
33+9+6+5+4+2+1 = 33+8+7+6+5+1 = 33+8+7+6+4+2 =
33+8+7+5+4+2+1 = 22+11+9+8+7+3 = 22+11+9+8+6+4 =
22+11+9+7+6+5 = 22+11+9+6+5+4+3 = 22+11+8+7+5+4+3 =
22+9+8+7+6+5+3 = 22+9+8+7+6+4+3+1.

Links

Crossrefs

Cf. A088670, A088669, A010785.

Extensions

a(0)=1 prepended by Alois P. Heinz, Jan 18 2016

A109951 First differences of A109950.

Original entry on oeis.org

0, 1, 0, 1, 1, 1, 1, 2, 2, 1, 3, 2, 2, 5, 2, 4, 3, 7, 2, 8, 2, 6, 9, 5, 3, 8, 10, 0, 14, -1, 12, 6, 6, 3, 13, 8, 4, 16, 0, 14, 17, 10, 4, 32, 7, 9, 32, 3, 28, 30, 9, 2, 42, 21, 0, 45, -3, 33, 30, -12, 2, 62, 18, -1, 54, -22, 60, 6, 19, -18, 146, -22, 16, 95, -7, 61, 11, 74, 10, 135, 25, -15
Offset: 1

Views

Author

Reinhard Zumkeller, Jul 06 2005

Keywords

Crossrefs

Cf. A109969.

Formula

a(n) = A109950(n+1) - A109950(n).

Extensions

Corrected by N. J. A. Sloane, Nov 05 2005
More terms from David Wasserman, Oct 28 2008

A109967 First differences of A088670.

Original entry on oeis.org

0, 1, 0, 1, 1, 1, 1, 2, 1, 2, 2, 1, 3, 2, 2, 2, 3, 1, 3, 2, 2, 2, 1, 2, 1, 2, 0, 2, 0, 1, 0, 2, 0, 0, 2, -1, 2, 0, 2, 0, 3, 0, 3, 2, 0, 4, 1, 3, 1, 4, 0, 4, 1, 4, 2, 0, 4, 0, 4, 0, 4, 0, 4, 0, 5, 2, 0, 6, 0, 5, 1, 6, 0, 7, 1, 7, 4, 0, 8, 1, 7, 1, 8, 0, 8, 1, 8, 4, 0, 9, 0, 8, 0, 9, -1, 9, 0, 10, 4, -1, 11, -1
Offset: 1

Views

Author

Reinhard Zumkeller, Jul 06 2005

Keywords

Comments

a(n) = A088670(n+1) - A088670(n).

Crossrefs

Cf. A109969.
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.