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 #8 Sep 20 2016 13:18:10
%S 14,297,869,1241,1349,1541,1769,1829,1961,2021,82091,88931,98171,
%T 100739,105779,111899,116651,122411,125771,130139,135419,139499,
%U 150971,152771,157979,158819,165251,169739,173939,174611,177851,182051,183731,188339,189731,193091
%N Numbers n such that Sum_{q|n} 0.q is an integer where q ranges over the aliquot parts of n.
%C Mainly numbers ending in 1 or 9.
%C So far Sum{q | n} 0.q is generally equal to 1 apart from 297 with 3 and 235569 with 6.
%H Paolo P. Lava, <a href="/A276699/b276699.txt">Table of n, a(n) for n = 1..48</a>
%e Aliquot parts of 14 are 1, 2, 7 and 0.1 + 0.2 + 0.7 = 1;
%e Aliquot parts of 297 are 1, 3, 9, 11, 27, 33, 99 and 0.1 + 0.3 + 0.9 + 0.11 + 0.27 + 0.33 + 0.99 = 3;
%p with(numtheory): P:= proc(q) local a,n;
%p for n from 2 to q do a:=sort([op(divisors(n))]);
%p if type(add(a[k]/10^(ilog10(a[k])+1),k=1..nops(a)-1),integer)
%p then print(n); fi; od; end: P(10^9);
%Y Cf. A276465, A276655, A276700.
%K nonn,base
%O 1,1
%A _Paolo P. Lava_, Sep 15 2016