|
|
A135034
|
|
Positive integers n repeated 2n-1 times, with a leading a(0) = 0. Also: ceiling of square root of n.
|
|
2
|
|
|
0, 1, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
LINKS
|
|
|
FORMULA
|
a(n) = ceiling(sqrt(n)).
|
|
EXAMPLE
|
a(1) = ceiling(sqrt(1)) = 1
a(6) = ceiling(sqrt(6)) = 3
|
|
MATHEMATICA
|
Table[PadRight[{}, 2n-1, n], {n, 0, 10}]//Flatten (* Harvey P. Dale, May 15 2022 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|