login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A069800 Triangular array in which n-th row consists of numbers with digit sum n arranged in increasing numerical order. 6

%I #10 Mar 15 2023 11:13:30

%S 1,2,11,3,12,21,111,4,13,22,31,112,121,211,1111,5,14,23,32,41,113,122,

%T 131,212,221,311,1112,1121,1211,2111,11111,6,15,24,33,42,51,114,123,

%U 132,141,213,222,231,312,321,411,1113,1122,1131,1212,1221,1311,2112,2121

%N Triangular array in which n-th row consists of numbers with digit sum n arranged in increasing numerical order.

%C 0 is not allowed as a digit.

%C Row n has A104144(n+8) terms. - _T. D. Noe_, Oct 27 2008

%H T. D. Noe, <a href="/A069800/b069800.txt">Rows n=1..11 of triangle, flattened</a>

%e Triangle begins:

%e 1;

%e 2,11;

%e 3,12,21,111;

%e 4,13,22,31,112,121,211,1111;

%e ...

%t Flatten[Table[p=Partitions[n,9]; Sort[Flatten[Table[FromDigits/@Permutations[p[[i]]], {i,Length[p]}]]], {n,6}]] (* _T. D. Noe_, Oct 27 2008 *)

%Y Cf. A069801.

%Y Cf. A007953. [_T. D. Noe_, Oct 27 2008]

%K nonn,tabf,base

%O 1,2

%A _Amarnath Murthy_, Apr 13 2002

%E More terms from _T. D. Noe_, Oct 27 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 30 00:54 EDT 2024. Contains 372115 sequences. (Running on oeis4.)