|
|
A362136
|
|
First differences of A362135.
|
|
2
|
|
|
1, 2, 2, 2, 2, 3, 3, 2, 4, 4, 4, 2, 5, 5, 6, 5, 6, 6, 5, 5, 8, 5, 5, 8, 6, 6, 8, 8, 10, 7, 8, 7, 8, 8, 7, 6, 9, 11, 11, 13, 9, 10, 13, 12, 8, 9, 15, 16, 13, 11, 10, 12, 13, 16, 13, 17, 17, 12, 15, 18, 23, 18, 12, 12, 13, 24, 12, 16, 20, 15, 20, 19, 21, 22, 12, 13, 15, 15, 12, 23, 21, 22, 24, 13, 5, 23
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Alternatively, row lengths of A360179 read as an irregular triangle of rows whose terms strictly increase.
|
|
LINKS
|
|
|
EXAMPLE
|
A360179 read as an irregular triangle of subsequences whose terms are nondecreasing.
----------------------------
1: 1; 1
2: 1, 2; 2
3: 2, 3; 2
4: 2, 4; 2
5: 3, 5; 2
6: 2, 4, 6; 3
7: 4, 6, 8; 3
8: 4, 7; 2
9: 2, 5, 7, 10; 4
10: 4, 7, 10, 12; 4
11: 6, 8, 12, 16; 4
12: 5, 9; 2
etc.
|
|
MATHEMATICA
|
nn = 960;
c[_] := False; m = h[_] := 0; f[n_] := DivisorSigma[0, n];
a[1] = j = u = w = 1;
{1}~Join~Rest@ Reap[Do[
If[c[j],
k = j + f[u]; h[j]++; h[u]--,
k = f[j]; c[j] = True; h[j]++; Sow[n - 1 - m]; Set[m, n - 1] ];
u = Min[u, j]; Set[{a[n], q[k], j}, {k, True, k}];
While[h[u] == 0, u++], {n, 2, nn}] ][[-1, -1]]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|