cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A066814 Smallest prime p such that (p-1) has n divisors, or 0 if no such prime exists.

This page as a plain text file.
%I A066814 #8 Mar 30 2012 18:37:42
%S A066814 2,3,5,7,17,13,0,31,37,113,0,61,0,193,401,211,65537,181,0,241,577,
%T A066814 13313,0,421,1297,12289,4357,2113,0,1009,0,1321,25601,2424833,
%U A066814 752734097,1801,0,786433,495617,2161,0,4801,0,15361,7057,155189249,0
%N A066814 Smallest prime p such that (p-1) has n divisors, or 0 if no such prime exists.
%C A066814 The only primes p for which p-1 has a prime number of divisors are Fermat primes A019434.
%e A066814 a(17)=65537 because DivisorSigma[0,65536]=17.
%t A066814 it=Table[ p=Prime[ n ]; DivisorSigma[ 0, p-1 ], {n, 400000} ]; Flatten[ Position[ it, #, 1, 1 ]&/@Range[ 100 ]/.{}- > 0 ]
%Y A066814 Cf. A004249, A007516, A066529.
%K A066814 nonn
%O A066814 1,1
%A A066814 _Wouter Meeussen_, Jan 20 2002
%E A066814 Comment clarified by _T. D. Noe_, Nov 06 2009
%E A066814 Edited by _Max Alekseyev_, Nov 10 2009