Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Sep 01 2015 14:48:45
%S 1,2,3,5,6,7,8,10,11,12,13,14,15,17,18,19,20,21,22,23,24,26,27,28,29,
%T 30,31,32,33,34,35,37,38,39,40,41,42,43,44,45,46,47,48,50,51,52,53,54,
%U 55,56,57,58,59,60,61,62,63,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79
%N 1 followed by numbers that are not squares.
%C Complement of A000290 for n >= 1.
%C a(n) = A255437(A255527(n)) and A255437(m) < a(n) for m < A255527(n), i.e. record values in A255437.
%F {1} Union A000037.
%F a(n) = A000037(n-1) = n-1+floor(1/2 + sqrt(n - 1)) = n-1 + floor( sqrt(n-1 + floor( sqrt(n - 1) ))) for n > 1.
%o (Haskell)
%o a164514 n = a164514_list !! (n-1)
%o a164514_list = 1 : a000037_list
%o -- _Reinhard Zumkeller_, Mar 23 2015
%o (PARI) is(n)=!issquare(n) || n==1 \\ _Charles R Greathouse IV_, Sep 01 2015
%Y Cf. A000037, A255437, A255527.
%K nonn,less,easy
%O 1,2
%A _Jaroslav Krizek_, Aug 14 2009
%E Edited by _R. J. Mathar_, Aug 21 2009