|
| |
|
|
A048760
|
|
Largest square <= n.
|
|
31
| |
|
|
0, 1, 1, 1, 4, 4, 4, 4, 4, 9, 9, 9, 9, 9, 9, 9, 16, 16, 16, 16, 16, 16, 16, 16, 16, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,5
|
|
|
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.
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.
F. Smarandache, Only Problems not Solutions!, Xiquan Publ. Hse., 1993.
|
|
|
LINKS
| Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
K. Atanassov, On Some of Smarandache's Problems
H. Bottomley, Illustration of A000196, A048760, A053186
M. L. Perez et al., eds., Smarandache Notions Journal
F. Smarandache, Only Problems, Not Solutions!
M. Somos, Sequences used for indexing triangular or square arrays
|
|
|
FORMULA
| a(n) = floor(n^(1/2))^2 = A000290(A000196(n)). [Reinhard Zumkeller Feb 12 2012, Sep 03 2002]
n^2 repeated (2n+1) times, n=0,1,.. (from Zak Seidov, zakseidov(AT)yahoo.com Oct 25 2008)
|
|
|
PROG
| (Haskell)
a048760 = (^ 2) . a000196 -- Reinhard Zumkeller, Feb 12 2012
|
|
|
CROSSREFS
| Sequence in context: A064053 A108893 A162281 * A035627 A165923 A174444
Adjacent sequences: A048757 A048758 A048759 * A048761 A048762 A048763
|
|
|
KEYWORD
| nonn,easy,changed
|
|
|
AUTHOR
| Charles T. Le (charlestle(AT)yahoo.com)
|
| |
|
|
