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!)
A072275 Least m such that one less than m-th prime has n divisors (or 0 if no such prime exists). 0

%I #10 Feb 06 2019 15:15:18

%S 2,3,4,7,6,0,11,12,30,0,18,0,44,79,47,0,42,0,53,106,1581,0,82,211,

%T 1470,595,319,0,169,0,216,2819,177975,38836904,279,0,62947,41203,326,

%U 0,647,0,1795,907,8719625,0,369,0,841,12545382,6180,0,820,190066763704011

%N Least m such that one less than m-th prime has n divisors (or 0 if no such prime exists).

%t Do[ If[ !PrimeQ[n], k = 1; While[ Length[ Divisors[ Prime[k] - 1]] != n, k++ ]; Print[k], Print[0]], {n, 6, 34}]

%Y A000040(a(n)) = A066814(n).

%K nonn

%O 2,1

%A _Lekraj Beedassy_, Jul 09 2002

%E More terms from _Robert G. Wilson v_, Jul 15 2002

%E a(35) inserted and a(46)-a(55) added by _Amiram Eldar_, Feb 06 2019

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 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)