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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A034683 Unitary abundant numbers (usigma(n)>2n). 24

%I

%S 30,42,66,70,78,102,114,138,150,174,186,210,222,246,258,282,294,318,

%T 330,354,366,390,402,420,426,438,462,474,498,510,534,546,570,582,606,

%U 618,630,642,654,660,678,690,714,726,750,762,770,780,786,798,822,834

%N Unitary abundant numbers (usigma(n)>2n).

%C If a term n in the sequence ends in neither 0 nor 5, then 10*n is also in the sequence. - _Lekraj Beedassy_, Jun 11 2004

%D C. Sung, Mathematical Buds, "Unitary Divisors", Chap. V pp. 42-67, Ed. H. D. Ruderman, Mu Alpha Theta OK 1978.

%H Nathaniel Johnston, <a href="/A034683/b034683.txt">Table of n, a(n) for n = 1..10000</a>

%p isA034683 := proc(n)

%p is(A034448(n) > 2*n) ;

%p end proc:

%p for n from 1 do

%p if isA034683(n) then

%p print(n);

%p end if;

%p end do: # _R. J. Mathar_, Nov 10 2014

%Y Cf. A034444, A034448, A129487.

%K nonn

%O 1,1

%A _Erich Friedman_

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 January 22 13:36 EST 2020. Contains 331149 sequences. (Running on oeis4.)