|
%I #72 Jul 06 2023 14:35:10
%S 3,5,7,11,13,15,17,19,21,23,27,29,31,33,35,37,39,41,43,45,47,51,53,55,
%T 57,59,61,63,65,67,69,71,73,75,77,79,83,85,87,89,91,93,95,97,99,101,
%U 103,105,107,109,111,113,115,117,119,123,125,127,129,131,133,135,137,139
%N Nonsquare positive odd numbers.
%C Odd numbers with even abundance: primes and some composites too.
%C Odd numbers with odd abundance are in A016754. Even numbers with odd abundance are in A088827. Even numbers with even abundance are in A088829.
%C Or, odd numbers without the squares. - _Gerald Hillier_, Apr 12 2009
%H Amiram Eldar, <a href="/A088828/b088828.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = 2*n + s - ((s+1) mod 2) where s = round(sqrt(2*n-1)). - _Gerald Hillier_, Apr 15 2009
%F A005408 SETMINUS A016754. - _R. J. Mathar_, Jun 16 2018
%F a(n) = 2*(n+h) + 1 where h = floor((1/4)*(sqrt(8*n) - 1)) is the largest value such that A014105(h) < n. - _John Tyler Rascoe_, Jul 05 2022
%e n = p prime, abundance = 1 - p = even and negative;
%e n = 21, sigma = 1 + 3 + 7 + 21 = 32, abundance = 32 - 42 = -20.
%t Do[s=DivisorSigma[1, n]-2*n; If[ !OddQ[s]&&OddQ[n], Print[{n, s}]], {n, 1, 1000}]
%t Select[Range[1, 500, 2], EvenQ[DivisorSigma[1, #] - 2 #] &] (* _Vladimir Joseph Stephan Orlovsky_, Apr 15 2011 *)
%o (Magma) [ n: n in [1..140 by 2] | IsEven(SumOfDivisors(n)-2*n) ]; // _Klaus Brockhaus_, Apr 15 2009
%o (PARI) isok(n) = (n>0) && (n % 2) && ! issquare(n); \\ _Michel Marcus_, Aug 28 2013
%o (Python)
%o from itertools import count, islice
%o from sympy.ntheory.primetest import is_square
%o def A088828_gen(startvalue=1): # generator of terms >= startvalue
%o return filter(lambda n:not is_square(n),count(max(startvalue+(startvalue&1^1),1),2))
%o A088828_list = list(islice(A088828_gen(),30)) # _Chai Wah Wu_, Jul 06 2023
%Y Cf. A005408, A014105, A016754, A088827, A088829, A157502.
%K nonn,easy
%O 1,1
%A _Labos Elemer_, Oct 28 2003
%E Entry revised by _N. J. A. Sloane_, Jan 31 2014 at the suggestion of _Omar E. Pol_
|
