|
Search: id:A000194
|
|
|
| A000194 |
|
n appears 2n times; also nearest integer to square root of n. |
|
+0
11
|
|
| 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 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, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
B. C. Berndt, Ramanujan's Notebooks Part IV, Springer-Verlag, see p. 78, Entry 24.
M. A. Nyblom, Some curious sequences ..., Am. Math. Monthly 109 (#6, 200), 559-564.
G. Gutin, Problem 913 (BCC20.5), Mediated digraphs, in Research Problems from the 20th Britsh Combinatorial Conference, Discrete Math., 308 (2008), 621-630.
|
|
LINKS
|
M. Somos, Sequences used for indexing triangular or square arrays
|
|
FORMULA
|
G.f.: f(x^2, x^6)*x/(1-x) where f(a, b) is Ramanujan's theta function.
a(n)=a(n-2*a(n-a(n-1)))+1. - Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 27 2002
a(n+1)=a(n)+A005369(n).
a(n)=floor((1/2)*(1 + sqrt(4*n - 3))). - Zak Seidov, Jan 18 2006
|
|
MAPLE
|
Digits := 100; f := n->round(evalf(sqrt(n))); [ seq(f(n), n=1..100) ];
|
|
PROGRAM
|
(PARI) a(n)=if(n<0, 0, ceil(sqrtint(4*n)/2)) - Michael Somos Feb 11 2004
|
|
CROSSREFS
|
Partial sums of A005369.
A000037(n) - n.
Adjacent sequences: A000191 A000192 A000193 this_sequence A000195 A000196 A000197
Sequence in context: A023967 A090532 A003058 this_sequence A097429 A100617 A076471
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Additional comments from Michael Somos, May 31, 2000.
|
|
|
Search completed in 0.002 seconds
|
