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.

A051851 Table in which n-th row gives all partitions of n interpreted in base n+1. (A subset of A051849 with each term having a non-descending digit-sequence in base n+1).

Original entry on oeis.org

1, 2, 4, 3, 6, 21, 4, 8, 12, 32, 156, 5, 10, 15, 45, 50, 260, 1555, 6, 12, 18, 24, 60, 66, 114, 402, 408, 2802, 19608, 7, 14, 21, 28, 77, 84, 91, 147, 588, 595, 658, 4683, 4690, 37450, 299593, 8, 16, 24, 32, 40, 96, 104, 112, 184, 192, 824, 832, 840, 912, 1640
Offset: 1

Views

Author

Antti Karttunen, Dec 13 1999

Keywords

Comments

All terms on row n are divisible by n (see A051852).

Examples

			Rows have lengths 1,2,3,5,7,11,15, etc. (A000041(n)). Terms: 1; 2, 4; 3, 6, 21; 4, 8, 12, 32, 156; 5, 10, 15, 45, 50, 260, 1555;
		

Crossrefs

A subset of A051849.

Programs

  • Maple
    with(combinat); rows_upto_u := proc(u) local a,n; a := []; for n from 1 to u do a := [op(a),op(sort(map(list_in_base_b,partition(n),(n+1))))]; od; RETURN(a); end; # list_in_base given in A051845.