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 #13 Jul 19 2024 08:31:02
%S 1,2,4,8,12,16,24,32,48,56,64,96,112,120,128,192,224,240,256,384,448,
%T 480,512,528,672,768,896,960,992,1024,1056,1344,1456,1536,1792,1920,
%U 1984,2048,2112,2160,2208,2688,2912,3072,3584,3840,3968,4096,4224,4320
%N Numbers k such that the sum of the odd aliquot parts of k divides k.
%F a(1)=1, a(2)=2, a(n) = A066192(n-2) for n > 2.
%Y Cf. A066192.
%K easy,nonn
%O 1,2
%A _Benoit Cloitre_, Apr 16 2002
%E Name corrected by _Sean A. Irvine_, May 02 2024