[go: up one dir, main page]

login
Revision History for A331152 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Triangle read by rows: T(n,k) (n>=k>=1) = f(n,n-k+1) where f(n,k) = ceiling((n/k)*floor(n/k)).
(history; published version)
#10 by Bruno Berselli at Wed Dec 02 07:40:03 EST 2020
STATUS

reviewed

approved

#9 by Joerg Arndt at Wed Dec 02 06:40:26 EST 2020
STATUS

proposed

reviewed

#8 by Michel Marcus at Wed Dec 02 05:53:48 EST 2020
STATUS

editing

proposed

#7 by Michel Marcus at Wed Dec 02 05:53:38 EST 2020
REFERENCES

McEliece, Robert J., and Herbert Taylor. "Covering tori with squares." Journal of Combinatorial Theory, Series A 14.1 (1973): 119-124.

LINKS

Robert J. McEliece and Herbert Taylor, <a href="https://doi.org/10.1016/0097-3165(73)90069-1">Covering tori with squares</a>, Journal of Combinatorial Theory, Series A 14.1 (1973): 119-124.

STATUS

approved

editing

#6 by N. J. A. Sloane at Tue Jan 14 21:43:41 EST 2020
STATUS

editing

approved

#5 by N. J. A. Sloane at Tue Jan 14 21:43:39 EST 2020
NAME

Triangle read by rows: T(n,k) (n>=k>=1) = f(n,n-k+1) where f(n,k) = floorceiling((n/k)*floor(n/k)).

EXAMPLE

1, 1, 2, 9,

1, 1, 2, 4, 16,

1, 1, 1, 2, 2, 5, 25,

1, 1, 1, 2, 2, 4, 9, 36,

1, 1, 1, 1, 4, 10, 2, 2, 2, 5, 11, 49,

1, 1, 1, 1, 2, 2, 2, 4, 5, 6, 16, 64,

1, 1, 1, 1, 1, 4, 2, 2, 2, 2, 5, 9, 18, 81,

1, 1, 1, 1, 1, 2, 2, 2, 2, 4, 5, 10, 25, 100,

1, 1, 1, 1, 1, 1, 4, 2, 2, 2, 2, 2, 5, 6, 11, 27, 28, 121,

1, 1, 1, 1, 1, 1, 4, 2, 2, 2, 2, 2, 4, 5, 9, 16, 36, 144,

1, 1, 1, 1, 1, 1, 1, 4, 2, 2, 2, 2, 2, 2, 5, 9, 17, 6, 10, 18, 39, 169,

#4 by N. J. A. Sloane at Tue Jan 14 21:42:54 EST 2020
NAME

cf2

Triangle read by rows: T(n,k) (n>=k>=1) = f(n,n-k+1) where f(n,k) = floor((n/k)*floor(n/k)).

REFERENCES

McEliece, Robert J., and Herbert Taylor. "Covering tori with squares." Journal of Combinatorial Theory, Series A 14.1 (1973): 119-124.

EXAMPLE

Triangle begins:

1,

1, 4,

1, 1, 9,

1, 1, 4, 16,

1, 1, 1, 5, 25,

1, 1, 1, 4, 9, 36,

1, 1, 1, 1, 4, 10, 49,

1, 1, 1, 1, 4, 5, 16, 64,

1, 1, 1, 1, 1, 4, 9, 18, 81,

1, 1, 1, 1, 1, 4, 5, 10, 25, 100,

1, 1, 1, 1, 1, 1, 4, 5, 11, 27, 121,

1, 1, 1, 1, 1, 1, 4, 4, 9, 16, 36, 144,

1, 1, 1, 1, 1, 1, 1, 4, 5, 9, 17, 39, 169,

...

CROSSREFS
KEYWORD

nonn,tabl,new

STATUS

approved

editing

#3 by N. J. A. Sloane at Tue Jan 14 21:42:19 EST 2020
STATUS

editing

approved

#2 by N. J. A. Sloane at Tue Jan 14 21:42:16 EST 2020
NAME

allocated for N. J. A. Sloane

cf2

DATA

1, 1, 4, 1, 2, 9, 1, 2, 4, 16, 1, 2, 2, 5, 25, 1, 2, 2, 4, 9, 36, 1, 2, 2, 2, 5, 11, 49, 1, 2, 2, 2, 4, 6, 16, 64, 1, 2, 2, 2, 2, 5, 9, 18, 81, 1, 2, 2, 2, 2, 4, 5, 10, 25, 100, 1, 2, 2, 2, 2, 2, 5, 6, 11, 28, 121, 1, 2, 2, 2, 2, 2, 4, 5, 9, 16, 36, 144, 1, 2, 2, 2, 2, 2, 2, 5, 6, 10, 18, 39, 169

OFFSET

1,3

KEYWORD

allocated

nonn

AUTHOR

N. J. A. Sloane, Jan 14 2020

STATUS

approved

editing

#1 by N. J. A. Sloane at Fri Jan 10 20:47:19 EST 2020
NAME

allocated for N. J. A. Sloane

KEYWORD

allocated

STATUS

approved