|
| |
|
|
A048761
|
|
Smallest square >= n.
|
|
11
| |
|
|
0, 1, 4, 4, 4, 9, 9, 9, 9, 9, 16, 16, 16, 16, 16, 16, 16, 25, 25, 25, 25, 25, 25, 25, 25, 25, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 81, 81, 81, 81, 81, 81, 81, 81, 81, 81
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| Contribution from M. F. Hasler (www.univ-ag.fr/~mhasler), Oct 05 2009: (Start)
For each k>0, the term k^2 is listed 2k-1 times.
a(n+1) is the least square > n. (End)
|
|
|
REFERENCES
| K. Atanassov, On the 40-th and 41-st Smarandache Problems, Notes on Number Theory and Discrete Mathematics, Sophia, Bulgaria, Vol. 4 (1998), No. 3, 101-104.
K. Atanassov, On Some of Smarandache's Problems, American Research Press, 1999, 27-32.
F. Smarandache, Only Problems not Solutions!, Xiquan Publ. Hse., 1993.
J. Castillo, Other Smarandache Type Functions: Inferior/Superior Smarandache f-part of x, Smarandache Notions Journal, Vol. 10, No. 1-2-3, 1999, 202-204.
|
|
|
LINKS
| M. L. Perez et al., eds., Smarandache Notions Journal
F. Smarandache, Only Problems, Not Solutions!
K. Atanassov, On Some of Smarandache's Problems
|
|
|
MAPLE
| A048761 := proc(n)
ceil(sqrt(n)) ;
%^2 ;
end proc: # R. J. Mathar, Sep 26 2011
|
|
|
PROG
| (PARI) A048761(n)=if(n, (sqrtint(n-1)+1)^2, 0) [From M. F. Hasler (www.univ-ag.fr/~mhasler), Oct 05 2009]
|
|
|
CROSSREFS
| Cf. A165775. [From M. F. Hasler (www.univ-ag.fr/~mhasler), Oct 05 2009]
Sequence in context: A176213 A065734 A200600 * A075561 A117405 A013601
Adjacent sequences: A048758 A048759 A048760 * A048762 A048763 A048764
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Charles T. Le (charlestle(AT)yahoo.com)
|
| |
|
|
