The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A326822

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

A326822

T(n, k) = k^0 if k = 1 else 0^n. Triangle read by rows, T(n, k) for 0 <= k <= n.
(history; published version)

#14 by R. J. Mathar at Tue Nov 21 09:14:20 EST 2023

STATUS

editing

approved

#13 by R. J. Mathar at Tue Nov 21 09:14:06 EST 2023

CROSSREFS

Essentially the same as A073424, A073423 and A010054.

STATUS

approved

editing

#12 by Susanna Cuyler at Tue Nov 19 10:00:58 EST 2019

STATUS

proposed

approved

#11 by Peter Luschny at Tue Nov 19 09:12:15 EST 2019

STATUS

editing

proposed

#10 by Peter Luschny at Tue Nov 19 09:08:32 EST 2019

NAME

T(n, k) = k^0 if k = 1 else 0^n. Triangle read by rows, T(n, k) for 0 <= k <= n.

KEYWORD

nonn,changed,tabl

Discussion

Tue Nov 19

09:11

Peter Luschny: I would not introduce this table if it were not the border case in some general context. I will reference it later at a suitable place.

#9 by Peter Luschny at Tue Nov 19 09:05:45 EST 2019

NAME

allocated for Peter LuschnyT(n, k) = k^0 if k = 1 else 0^n.

DATA

1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

OFFSET

0

EXAMPLE

[1]

[0, 1]

[0, 1, 0]

[0, 1, 0, 0]

[0, 1, 0, 0, 0]

[0, 1, 0, 0, 0, 0]

[0, 1, 0, 0, 0, 0, 0]

PROG

(Julia)

T(n, k) = k == 1 ? k^0 : 0^n

for n in 0:10 println([T(n, k) for k in 0:n]) end

KEYWORD

allocated

nonn

AUTHOR

Peter Luschny, Nov 19 2019

STATUS

approved

editing

#8 by Peter Luschny at Mon Nov 18 08:10:52 EST 2019

NAME

allocated for Peter Luschny

KEYWORD

recycled

allocated

#7 by Joerg Arndt at Mon Nov 18 02:52:09 EST 2019

STATUS

editing

approved

#6 by Joerg Arndt at Mon Nov 18 02:52:06 EST 2019

NAME

The numbers 2-10 written in bases 2-10 in ascending order. All numbers appear only once.

DATA

2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 20, 21, 22, 100, 101, 110, 111, 1000, 1001, 1010

OFFSET

1,1

COMMENTS

It appears as n (base and final number) gets bigger the first digits of the sequence are just the numbers 2-n, then it switches to writing the numbers in another base lower than n, then another base lower than that and so on until it reaches base two were the sequence inevitably stops. (Observation)

KEYWORD

nonn,base

recycled

AUTHOR

Nils Ledin, Oct 17 2019

#5 by Nils Ledin at Sun Oct 20 10:25:28 EDT 2019

NAME

allocated for Nils LedinThe numbers 2-10 written in bases 2-10 in ascending order. All numbers appear only once.

DATA

2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 20, 21, 22, 100, 101, 110, 111, 1000, 1001, 1010

OFFSET

1,1

COMMENTS

KEYWORD

allocated

nonn,base

AUTHOR

Nils Ledin, Oct 17 2019

STATUS

approved

editing

Discussion

Sun Oct 20

11:03

Joerg Arndt: This one looks quite arbitrary to me.  Leaving to the other editors.

Sun Nov 17

12:41

OEIS Server: This sequence has not been edited or commented on for a week
yet is not proposed for review.  If it is ready for review, please
visit https://oeis.org/draft/A326822 and click the button that reads
"These changes are ready for review by an OEIS Editor."

Thanks.
  - The OEIS Server