The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A351995

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A351995

Square array A(n, k), n, k >= 0, read by antidiagonals upwards; A(n, k) = Sum_{ i >= 0 } b_i * 2^(k*i) where n = Sum_{ i >= 0 } b_i * 2^i.
(history; published version)

#15 by Michael De Vlieger at Tue Mar 01 14:51:56 EST 2022

STATUS

reviewed

approved

#14 by Michel Marcus at Tue Mar 01 12:32:47 EST 2022

STATUS

proposed

reviewed

#13 by Rémy Sigrist at Tue Mar 01 12:26:15 EST 2022

STATUS

editing

proposed

#12 by Rémy Sigrist at Tue Mar 01 12:20:01 EST 2022

LINKS

Rémy Sigrist, <a href="/A351995/b351995.txt">Table of n, a(n) for n = 0..10010</a>

STATUS

approved

editing

Discussion

Tue Mar 01

12:26

Rémy Sigrist: added b-file

#11 by Michael De Vlieger at Mon Feb 28 12:14:18 EST 2022

STATUS

proposed

approved

#10 by Rémy Sigrist at Mon Feb 28 07:05:18 EST 2022

STATUS

editing

proposed

Discussion

Mon Feb 28

08:34

Bernard Schott: Also, A(4, k) = 4^k; A(5, k) = 4^k + 1; A(6, k) = 2^k + 4^k, A(7, k) = 2^k + 4^k + 1.

#9 by Rémy Sigrist at Mon Feb 28 02:22:27 EST 2022

COMMENTS

In other words, in binary expansion of n, replace 2^i by 2^(k*i).

#8 by Rémy Sigrist at Mon Feb 28 02:21:09 EST 2022

FORMULA

A(A(n, k), k') = A(n, k*k') for k, k' > 0.

#7 by Rémy Sigrist at Sun Feb 27 16:27:03 EST 2022

NAME

Square array A(n, k), n, k >= 0, read by antidiagonals upwards; TA(n, k) = Sum_{ i >= 0 } b_i * 2^(k*i) where n = Sum_{ i >= 0 } b_i * 2^i.

#6 by Rémy Sigrist at Sun Feb 27 16:23:02 EST 2022

CROSSREFS

Cf. A000120, A000695, A033045, A033052, A352001.