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!)
A063973 a(n) is the largest m such that usigma(m) = n (or 0 if no such m). 2

%I #9 Dec 29 2020 10:50:17

%S 1,0,2,3,4,5,0,7,8,9,0,11,0,13,0,0,16,17,0,19,0,0,0,23,0,25,0,27,0,29,

%T 0,31,32,0,0,24,0,37,0,28,0,41,0,43,0,0,0,47,0,49,0,0,0,53,0,39,0,0,0,

%U 59,0,61,0,0,64,0,0,67,0,52,0,71,0,73,0,0,0,50,0,79,0,81,0,83,0,0,0,0

%N a(n) is the largest m such that usigma(m) = n (or 0 if no such m).

%C usigma(m) is the sum of unitary divisors of m, A034448.

%H Daniel Suteu, <a href="/A063973/b063973.txt">Table of n, a(n) for n = 1..10000</a>

%e a(12)=11 because the unitary divisors of 11 are 1,11; they sum to 12.

%Y Cf. A034444, A034448, A051444, A057637, A063972.

%K nonn

%O 1,3

%A _Labos Elemer_, Sep 05 2001

%E Corrected by _Don Reble_, May 14 2006

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 17 22:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)