1,1

Note the remarkable formula for the n-th term (see the FORMULA section)!

These are the natural numbers with an even number of divisors. The number of divisors is odd for the complementary sequence, the squares (sequence A000290) and the numbers for which the number of divisors is divisible by 3 is sequence A059269. - Ola Veshta (olaveshta(AT)my-deja.com), Apr 04 2001

Also, a(n) = largest integer m not equal to n such that n = (floor(n^2/m) + m)/2. - Alexander R. Povolotsky (pevnev(AT)juno.com), Feb 10 2008

A010052(a(n)) = 0. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 26 2010]

A173517(a(n)) = n; a(n)^2 = A030140(n). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 20 2010]

Special case of formula from Farhi for positive integers which are not r-th powers [Jonathan Vos Post, May 5, 2011].

Union of A007969 and A007970; A007968(a(n)) > 0. [Reinhard Zumkeller, Jun 18 2011]

A. J. dos Reis and D. M. Silberger, "Generating nonpowers by formula", Mathematics Magazine 63 (1990), pp. 53-55.

J. Lambek and L. Moser, "Inverse and complementary sequences of natural numbers", The American Mathematical Monthly, Vol. 61, No. 7 (1954), 454-458, doi 10.2307/2308078, see example 4 (includes the formula). [From Nicolas Normand (Nicolas.Normand(AT)polytech.univ-nantes.fr), Nov 24 2009]

M. A. Nyblom, "Some curious sequences involving floor and ceiling functions", American Mathematical Monthly 109 (2002), pp. 559-564.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

N. J. A. Sloane, Table of n, a(n) for n = 1..10000

Bakir Farhi, An explicit formula generating the non-Fibonacci numbers, May 5, 2011.

S. R. Finch, Class number theory

Eric Weisstein's World of Mathematics, Square Number

Eric Weisstein's World of Mathematics, Continued Fraction

a(n) = n + [1/2 + sqrt(n)].

Another formula: a(n) = n + [ sqrt( n + [ sqrt n ] ) ].

a(n) = A000194(n) + n = floor(1/2 *(1 + sqrt(4*n-3)))+ n. [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Jun 14 2009]

d(a(n))=even. [From Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Oct 20 2009]

a(n) = A000194(n) + n.

For example note that the squares 1, 4, 9, 16 are not included.

a(A002061(n)) = a(n^2-n+1) = A002522(n) = n^2 + 1. A002061(n) = central polygonal numbers (n^2-n+1). A002522(n) = numbers of the form n^2 + 1. [From Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Jun 21 2009]

A000037 := n->n+floor(1/2+sqrt(n));

f[n_] := (n + Floor[Sqrt[n + Floor[Sqrt[n]]]]); Table[ f[n], {n, 71}] (from Robert G. Wilson v Sep 24 2004)

f[n_]:=Round[Sqrt[n]]; lst={}; Do[AppendTo[lst, n+f[n]], {n, 0, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Oct 13 2009]

(MAGMA) [n : n in [1..1000] | not IsSquare(n) ];

(MAGMA) at:=0; for n in [1..10000] do if not IsSquare(n) then at:=at+1; print at, n; end if; end for;

(PARI) a(n)=if(n<0, 0, n+(1+sqrtint(4*n))\2)

Cf. A007412, A000005, A000290, A059269.

Cf. A134986.

Cf. A087153, A172151. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 26 2010]

Sequence in context: A072099 A046841 A164514 * A028761 A028809 A028785

Adjacent sequences:  A000034 A000035 A000036 * A000038 A000039 A000040

easy,nonn,nice,changed

N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com)

Edited by Charles R Greathouse IV (charles.greathouse(AT)case.edu), Oct 30 2009