Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A339674

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Irregular triangle T(n, k), n, k >= 0, read by rows; for any number m with runs in binary expansion (r_1, ..., r_j), let R(m) = {r_1 + ... + r_j, r_2 + ... + r_j, ..., r_j}; row n corresponds to the numbers k such that R(k) is included in R(n), in ascending order.
(history; published version)
#23 by Susanna Cuyler at Wed Feb 24 08:20:22 EST 2021
STATUS

proposed

approved

#22 by Rémy Sigrist at Tue Feb 23 14:59:47 EST 2021
STATUS

editing

proposed

#21 by Rémy Sigrist at Tue Feb 23 14:53:56 EST 2021
LINKS

Rémy Sigrist, <a href="/A339674/b339674.txt">Table of n, a(n) for n = 0..6560</a>

STATUS

approved

editing

Discussion
Tue Feb 23
14:59
Rémy Sigrist: added b-file
#20 by N. J. A. Sloane at Tue Feb 23 12:37:54 EST 2021
STATUS

proposed

approved

#19 by Rémy Sigrist at Tue Feb 23 01:45:22 EST 2021
STATUS

editing

proposed

#18 by Rémy Sigrist at Sun Feb 21 11:50:06 EST 2021
LINKS

Rémy Sigrist, <a href="/A339674/a339674.gp.txt">PARI program for A339674</a>

Rémy Sigrist, <a href="/A339674/a339674.gp.txt">PARI program for A339674</a>

<a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>

#17 by Rémy Sigrist at Sun Feb 21 11:49:37 EST 2021
LINKS

Rémy Sigrist, <a href="/A339674/a339674.png">Scatterplot of (n, T(n, k)) for n <= 2^10</a>

#16 by Rémy Sigrist at Sun Feb 21 11:46:32 EST 2021
LINKS

Rémy Sigrist, <a href="/A339674/a339674.gp.txt">PARI program for A339674</a>

#15 by Rémy Sigrist at Sun Feb 21 11:45:22 EST 2021
NAME

allocated Irregular triangle T(n, k), n, k >= 0, read by rows; for Rémy Sigristany number m with runs in binary expansion (r_1, ..., r_j), let R(m) = {r_1 + ... + r_j, r_2 + ... + r_j, ..., r_j}; row n corresponds to the numbers k such that R(k) is included in R(n), in ascending order.

DATA

0, 0, 1, 0, 1, 2, 3, 0, 3, 0, 3, 4, 7, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 6, 7, 0, 7, 0, 7, 8, 15, 0, 1, 6, 7, 8, 9, 14, 15, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 0, 3, 4, 7, 8, 11, 12, 15, 0, 3, 12, 15, 0, 1, 2, 3, 12, 13, 14, 15, 0, 1, 14, 15, 0

OFFSET

0,6

COMMENTS

For any m > 0, R(m) contains the partial sums of the m-th row of A227736; by convention, R(0) = {}.

The underlying idea is to take some or all of the rightmost runs of a number, and possibly merge some of them.

For any n >= 0, the n-th row:

- has 2^A000120(A003188(n)) terms,

- has first term 0 and last term A003817(n),

- has n at position A090079(n),

- corresponds to the distinct terms in n-th row of table A341840.

FORMULA

T(n, 0) = 0.

T(n, A090079(n)) = n.

T(n, 2^A000120(A003188(n))-1) = A003817(n).

EXAMPLE

The triangle starts:

0;

0, 1;

0, 1, 2, 3;

0, 3;

0, 3, 4, 7;

0, 1, 2, 3, 4, 5, 6, 7;

0, 1, 6, 7;

0, 7;

0, 7, 8, 15;

0, 1, 6, 7, 8, 9, 14, 15;

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15;

0, 3, 4, 7, 8, 11, 12, 15;

0, 3, 12, 15;

0, 1, 2, 3, 12, 13, 14, 15;

0, 1, 14, 15;

0, 15;

...

PROG

(PARI) See Links section.

KEYWORD

allocated

nonn,base,tabf

AUTHOR

Rémy Sigrist, Feb 21 2021

STATUS

approved

editing

#14 by Rémy Sigrist at Sun Feb 21 11:45:22 EST 2021
NAME

allocated for Rémy Sigrist

KEYWORD

recycled

allocated