|
| |
|
|
A028392
|
|
n+[ sqrt(n) ].
|
|
15
| |
|
|
0, 2, 3, 4, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 20, 21, 22, 23, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 72, 73, 74, 75, 76, 77, 78, 79
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| A171746 gives number of iterations to reach a square. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 14 2010]
Contribution from Carmine Suriano (surianonoi5(AT)libero.it), Oct 15 2010: (Start)
Also the sequence of integers left after performing the following procedure:
1. Remove the element at 1-st position (1) and compact the sequence;
2. Remove the element at 4th(=2^2) position (5) and compact the sequence;
3. Remove the element at 9th(=3^2) position (11) and compact the sequence;
....
n. Remove the element at (n-square)th(=n^2) position (n^2+n-1) and compact the sequence;
(End)
|
|
|
REFERENCES
| Problem B4 in L. F. Klosinski, G. L. Alexanderson and A. P. Hillman, The William Lowell Putnam Mathematical Competition, Amer. Math. Monthly 91 (1984), 487-495.
|
|
|
LINKS
| R. Zumkeller, Table of n, a(n) for n = 0..10000 [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 14 2010]
|
|
|
MATHEMATICA
| f[n_]:=n+Floor[Sqrt[n]]; Table[f[n], {n, 0, 5!}] [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Mar 29 2010]
|
|
|
PROG
| (PARI) a(n)=if(n<0, 0, n+sqrtint(n))
|
|
|
CROSSREFS
| Complement of A028387.
Cf. A000196. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 14 2010]
A028387 is the complement [From Carmine Suriano (surianonoi5(AT)libero.it), Oct 15 2010]
Sequence in context: A014155 A166527 A039223 * A175970 A183293 A184524
Adjacent sequences: A028389 A028390 A028391 * A028393 A028394 A028395
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
