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!)
A359132 Least m such that the sum of the aliquot parts of m (A001065) equals n, or -1 if no such number exists. 4

%I #10 Jan 10 2023 18:35:02

%S 1,2,-1,4,9,-1,6,8,10,15,14,21,121,27,22,16,12,39,289,65,34,18,20,57,

%T 529,95,46,69,28,115,841,32,58,45,62,93,24,155,1369,217,44,63,30,50,

%U 82,123,52,129,2209,75,40,141,-1,235,42,36,106,99,68,265,3481,371,118,64,56,117,54

%N Least m such that the sum of the aliquot parts of m (A001065) equals n, or -1 if no such number exists.

%C "Least inverse" to A001065.

%C A070015 is essentially the same, except it has a different offset and a different "escape clause" value.

%H Thomas Scheuerle, <a href="/A359132/b359132.txt">Table of n, a(n) for n = 0..10000</a>

%Y Cf. A001065, A070015.

%K sign

%O 0,2

%A _N. J. A. Sloane_, Jan 10 2023

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 May 11 07:10 EDT 2024. Contains 372388 sequences. (Running on oeis4.)