|
|
A167991
|
|
Blocks of size 2n, each with 2n-1 replicas of 2n followed by 2n+1; n=1, 2, 3, ...
|
|
3
|
|
|
2, 3, 4, 4, 4, 5, 6, 6, 6, 6, 6, 7, 8, 8, 8, 8, 8, 8, 8, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 17, 18, 18, 18, 18
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The sum of the terms in block n is 4*n^2+1 = A053755(n).
|
|
LINKS
|
|
|
EXAMPLE
|
(2, 3), (4, 4, 4, 5), (6, 6, 6, 6, 6, 7), (8, 8, 8, 8, 8, 8, 8, 9), ...
|
|
MATHEMATICA
|
r[1] = Range[4];
r[n_] := r[n] = Range[r[n-1][[-1]]+1, r[n-1][[-1]] + (2n)^2];
s[n_] := Partition[r[n], Sqrt[Length[r[n]]]][[All, n]];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|