login

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”).

A243985
Numbers n such that A243984(n), the sum of non-twin divisors of n, is a square.
1
1, 3, 4, 8, 9, 16, 20, 22, 24, 27, 35, 48, 64, 90, 94, 115, 119, 143, 170, 171, 192, 200, 214, 216, 217, 265, 310, 322, 323, 343, 382, 497, 517, 527, 656, 679, 710, 729, 742, 745, 782, 862, 889, 899, 935, 970, 1066, 1174, 1177, 1207, 1219, 1270, 1393, 1426
OFFSET
1,2
COMMENTS
See A243917 for definition of non-twin divisor.
Squares included in the sequence are : 1, 4, 9, 16, 64, 729, ...
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..8692 (a(n) < 5,000,000)
EXAMPLE
The positive divisors of 8 are 1, 2, 4, 8. Of these, 1 and 8 are non-twin divisors. So 8 is in this sequence, which is 1 + 8 = 3^2.
MATHEMATICA
a243984[n_Integer] := Total[Select[Divisors[n], If[And[# <= 2 || Divisible[n, # - 2] == False, Divisible[n, # + 2] == False], True, False] &]]; a243985[n_Integer] := Flatten@Select[Position[Sqrt[a243984 /@ Range[n]], _?IntegerQ], If[Length[#] == 1, True, False] &]; a243985[1500] (* Michael De Vlieger, Aug 17 2014 *)
PROG
(PARI)
A243984(n) = s=0; fordiv(n, d, if(!((d>2 && n%(d-2)==0) || (d<=n-2 && n%(d+2)==0)), s+=d)); s
for(n=1, 200, if(issquare(A243984(n)), print1(n, ", "))) \\ Colin Barker, Jun 29 2014
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
Several terms corrected by Colin Barker, Jun 29 2014
STATUS
approved