login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A212489 Numbers n such that A001065(x)*x = n has at least two solutions, where x is a deficient number. 3

%I #12 May 22 2012 02:48:29

%S 1245335,318047135,358491735,533718135,709131500,1122571695,

%T 1814416175,3565970135,4486354631,14336906175,14827262351,22805269551,

%U 36360557831,43971297884,72370166375,99254203895,102204949847,145262865020,156161459559,173741271935,231267964895

%N Numbers n such that A001065(x)*x = n has at least two solutions, where x is a deficient number.

%e Example: For n=1245335, A001065(1955)*1955 = 1245335, A001065(2093)*2093 = 1245335, A001065(1955) < 1955, A001065(2093) < 2093, therefore 1245335 is included in this sequence.

%Y Cf. A005100, A212490, A212373, A212327.

%K nonn

%O 1,1

%A _Naohiro Nomoto_, May 18 2012

%E a(6)-a(21) from _Donovan Johnson_, May 21 2012

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 09:56 EDT 2024. Contains 371967 sequences. (Running on oeis4.)