login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066192 Composite n such that the sum of the odd aliquot parts of n divides n. 2
4, 8, 12, 16, 24, 32, 48, 56, 64, 96, 112, 120, 128, 192, 224, 240, 256, 384, 448, 480, 512, 528, 672, 768, 896, 960, 992, 1024, 1056, 1344, 1456, 1536, 1792, 1920, 1984, 2048, 2112, 2160, 2208, 2688, 2912, 3072, 3584, 3840, 3968, 4096, 4224, 4320, 4416 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,1000

MATHEMATICA

Do[ d = Drop[ Divisors[ n ], -1 ]; l = Length[ d ]; od = 1; k = 2; While[ k <= l, If[ OddQ[ d[ [ k ] ] ], od = od + d[ [ k ] ] ]; k++ ]; If[ !PrimeQ[ n ] && IntegerQ[ n/od ], Print[ n ] ], {n, 2, 10^4} ]

PROG

(PARI) { n=0; for (m=4, 10^9, if (isprime(m), next); d=divisors(m); s=1; for (i=2, numdiv(m) - 1, if (d[i]%2, s += d[i])); if (s > 0 && m%s == 0, write("b066192.txt", n++, " ", m); if (n==1000, return)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Feb 05 2010]

CROSSREFS

Sequence in context: A190952 A172412 A071385 * A097981 A033833 A045783

Adjacent sequences:  A066189 A066190 A066191 * A066193 A066194 A066195

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 15 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:21 EST 2012. Contains 205860 sequences.