|
Search: id:A088371
|
|
|
| A088371 |
|
Position where n is inserted into the n-th row of triangle A088370, where the n-th row differs from the prior row only by the presence of n. |
|
+0
2
|
|
| 1, 2, 2, 4, 2, 5, 4, 8, 2, 7, 5, 11, 4, 11, 8, 16, 2, 11, 7, 17, 5, 16, 11, 23, 4, 17, 11, 25, 8, 23, 1, 6, 32, 2, 19, 11, 29, 7, 26, 17, 37, 5, 26, 16, 38, 11, 34, 23, 47, 4, 29, 17, 43, 11, 38, 25, 53, 8, 37, 23, 53, 16, 47, 32, 64, 2, 35, 19, 53, 11, 46, 29, 65, 7, 44, 26, 64, 17
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
FORMULA
|
a(2^n)=2^n.
a(2*n-1)=a(n), a(2*n)=n+a(n).
|
|
EXAMPLE
|
A088370 rows: {1}, {1, 2}, {1, 3, 2}, {1, 3, 2, 4}, {1, 5, 3, 2, 4}, {1, 5, 3, 2, 6, 4}, {1, 5, 3, 7, 2, 6, 4}, ...
Row 5 is formed from row 3, {1, 3, 2} and row 2, {1, 2}: {1, 5, 3, 2, 4} = {1*2-1, 3*2-1, 2*2-1}|{1*2, 2*2}.
|
|
PROGRAM
|
(PARI) L=100; b=vector(L, k, k); c=vector(L); a=vector(L, k, b); a[1]=[1]; print1(1, ", "); for(n=2, L, i=floor((n+1)/2); j=floor(n/2); b=a[i]; b=vector(i, k, b[k]=2*b[k]-1 ); c=a[j]; c=vector(j, k, c[k]=2*c[k]); a[n]=concat(b, c); t=a[n]; for(k=1, n, if(t[k]==n, print1(k, ", "); k=n+1)))
|
|
CROSSREFS
|
Cf. A088370 (triangle).
Sequence in context: A125296 A121895 A139555 this_sequence A133181 A090397 A054704
Adjacent sequences: A088368 A088369 A088370 this_sequence A088372 A088373 A088374
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Paul D. Hanna (pauldhanna(AT)juno.com), Sep 28 2003
|
|
|
Search completed in 0.002 seconds
|
