The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A136446 Numbers n such that some subset of the numbers { 1 < d < n : d divides n } adds up to n. 9

%I

%S 12,18,24,30,36,40,42,48,54,56,60,66,72,78,80,84,90,96,100,102,108,

%T 112,114,120,126,132,138,140,144,150,156,160,162,168,174,176,180,186,

%U 192,196,198,200,204,208,210,216,220,222,224,228,234,240,246

%N Numbers n such that some subset of the numbers { 1 < d < n : d divides n } adds up to n.

%C This is a subset of the pseudoperfect numbers A005835 and thus non-deficient (A023196), but in view of the definition actually abundant numbers (A005101). Sequence A122036 lists odd abundant numbers (A005231) which are not in this sequence. So far, 351351 is the only one we know. (As of today, no odd weird (A006037: abundant but not pseudoperfect) number is known.) - _M. F. Hasler_, Apr 13 2008

%C This sequence contains infinitely many odd elements: any proper multiple of any pseudoperfect number is in the sequence, so odd proper multiples of odd pseudoperfect numbers are in the sequence. The first such is 2835 = 3 * 945 (which is in the b-file). - _Franklin T. Adams-Watters_, Jun 18 2009

%C A211111(a(n)) > 1. - _Reinhard Zumkeller_, Apr 04 2012

%D Mladen Vassilev, Two theorems concerning divisors, Bull. Number Theory Related Topics 12 (1988), pp. 10-19.

%H M. F. Hasler, <a href="/A136446/b136446.txt">Table of n, a(n) for n = 1..24491</a> (confirmed by _R. J. Mathar_, Mar 20 2011).

%p isA136446a := proc(s,n) if n in s then return true; elif add(i,i=s) < n then return false; elif nops(s) = 1 then is(op(1,s)=n) ; else sl := sort(convert(s,list),`>`) ; for i from 1 to nops(sl) do m := op(i,sl) ; if n -m = 0 then return true; end if ; if n-m > 0 then sr := [op(i+1..nops(sl),sl)] ; if procname(convert(sr,set),n-m) then return true; end if; end if; end do; return false; end if; end proc:

%p isA136446 := proc(n) isA136446a( numtheory[divisors](n) minus {1,n},n) ; end proc:

%p for n from 1 to 400 do if isA136446(n) then printf("%d,",n) ; end if; end do ; # _R. J. Mathar_, Mar 20 2011

%t okQ[n_] := Module[{d}, If[PrimeQ[n], False, d = Most[Rest[Divisors[n]]]; MemberQ[Plus @@@ Subsets[d], n]]]; Select[Range[2, 246], okQ]

%t (* _T. D. Noe_, Jul 24 2012 *)

%o (PARI)

%o N=72 \\ up to this value

%o vv=vector(N);

%o { for(n=2, N,

%o if ( isprime(n), next() );

%o d=divisors(n);

%o d=vector(#d-2,j,d[j+1]); \\ not n, not 1

%o for (k=1, (1<<#d)-1, \\ all subsets

%o t=vecextract(d, k);

%o if ( n==sum(j=1,#t,t[j]),

%o vv[n] += 1;););); }

%o for (j=1, #vv, if (vv[j]>0, print1(j,", "))) \\ A005835 (after correction)

%o (PARI) is_A136446(n,d=divisors(n))={#d>2 && is_A005835(n,d[2..-2])} \\ Replaced old code not conforming to current PARI syntax. - _M. F. Hasler_, Jul 28 2016

%o for( n=1,10^4, is_A136446(n) && print1(n", ")) \\ _M. F. Hasler_, Apr 13 2008

%o a136446 n = a136446_list !! (n-1)

%o a136446_list = map (+ 1) \$ findIndices (> 1) a211111_list

%o -- _Reinhard Zumkeller_, Apr 04 2012

%o (Sage)

%o def isa(s, n): # After R. J. Mathar's Maple code

%o if n in s: return True

%o if sum(s) < n: return False

%o if len(s) == 1: return s[0] == n

%o for i in srange(len(s)-1,-1,-1) :

%o d = n - s[i]

%o if d == 0: return True

%o if d > 0:

%o if isa(s[i+1:], d): return True

%o return False

%o isA136446 = lambda n : isa(divisors(n)[1:-1], n)

%o [n for n in (1..246) if isA136446(n)]

%o # _Peter Luschny_, Jul 23 2012

%Y See A005835 (allowing for divisor 1).

%Y Cf. A122036 = A005231 \ A136446.

%K nonn

%O 1,1

%A _Joerg Arndt_, Apr 06 2008

%E More terms from _M. F. Hasler_, Apr 13 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 12 18:52 EDT 2021. Contains 342931 sequences. (Running on oeis4.)