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).

This page as a plain text file.
%I A051851 #9 May 01 2014 02:49:32
%S A051851 1,2,4,3,6,21,4,8,12,32,156,5,10,15,45,50,260,1555,6,12,18,24,60,66,
%T A051851 114,402,408,2802,19608,7,14,21,28,77,84,91,147,588,595,658,4683,4690,
%U A051851 37450,299593,8,16,24,32,40,96,104,112,184,192,824,832,840,912,1640
%N 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).
%C A051851 All terms on row n are divisible by n (see A051852).
%e A051851 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;
%p A051851 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.
%Y A051851 A subset of A051849.
%K A051851 easy,nonn,tabf,base
%O A051851 1,2
%A A051851 _Antti Karttunen_, Dec 13 1999