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!)
A356445 a(n) is the number of times that A064440(n) occurs as the sum of proper divisors function (A001065). 2

%I #35 Sep 24 2022 07:14:51

%S 2,3,5,7,13,17,19,23,31,41,59,61,67,79,83,97,101,109,113,127,131,139,

%T 149,151,193,199,223,227,229,277,283,317,397,433,521,541,577,607,677,

%U 743,757,811,863,881,911,971,1031,1049,1063,1093,1249,1319,1373,1433,1489

%N a(n) is the number of times that A064440(n) occurs as the sum of proper divisors function (A001065).

%C The record values correspond to the terms of A064440.

%C All the terms are primes by definition.

%H Amiram Eldar, <a href="/A356445/b356445.txt">Table of n, a(n) for n = 1..188</a>

%F a(n) = A048138(A064440(n)).

%t seq[max_] := Module[{s = Table[0, {n, 1, max}], i, v = {}, m = 0}, Do[If[(i = DivisorSigma[1, n] - n) <= max, s[[i]]++], {n, 2, (max - 1)^2}]; Do[If[s[[i]] > m && PrimeQ[s[[i]]], m = s[[i]]; AppendTo[v, s[[i]]]], {i, 1, max}]; v]; seq[2000]

%Y Cf. A001065, A048138, A064440, A238895, A238896.

%K nonn

%O 1,1

%A _Amiram Eldar_, Sep 23 2022

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 July 19 17:03 EDT 2024. Contains 374410 sequences. (Running on oeis4.)