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.

Previous Showing 11-15 of 15 results.

A285642 Smallest Brazilian prime in base n, or 0 if no such prime exists.

Original entry on oeis.org

7, 13, 0, 31, 43, 2801, 73, 0, 1111111111111111111, 50544702849929377, 157, 30941, 211, 241, 0, 307
Offset: 2

Views

Author

Bernard Schott, Apr 23 2017

Keywords

Comments

Also the smallest prime of the form (n^k - 1)/(n - 1) with k > 2. The corresponding values of k are in A128164.
For n = 18, a(n) = (18^25667 - 1)/17 as explained in the extension of A128164, but it is too large to write in the Data field.
Differs from A084738: in A084738, the primes of the form (n^2 - 1)/(n - 1) = n + 1 are included, for instance 7 = 6 + 1 = 11_6 but not included here, so a(6) = 43 = 111_6.
As mentioned by Dubner, see link, when n is a power of a prime ( >= 2 ), the number (n^k - 1)/(n - 1) with k > 2 is usually composite, so a(4) = a(9) = a(16) = a(25) = 0 for instance, exception a(8) = 73.
Values of a(19)-a(31): {109912203092239643840221, 421, 463, 245411, 292561, 601, 0, 321272407, 757, 637421, 732541, 837931, 917087137}. - Michael De Vlieger, Apr 24 2017

Examples

			a(7) = (7^5 - 1)/6 = 11111_7 =  1 + 7 + 7^2 + 7^3 + 7^4 = 2801.
a(10) is the repunit R_19 which is a string of nineteen 1's.
		

Crossrefs

Programs

  • Mathematica
    Table[Function[m, If[m > 0, k = 3; While[! PrimeQ[Set[x, (m^k - 1)/(m - 1)]], k++]; x, 0]]@ If[Set[e, GCD @@ #[[All, -1]]] > 1, {#, IntegerExponent[n, #]} &@ Power[n, 1/e] /. {{k_, m_} /; Or[Not[PrimePowerQ@ m], Prime@ m, FactorInteger[m][[1, 1]] == 2] :> 0, {k_, m_} /; m > 1 :> n}, n] &@ FactorInteger@ n, {n, 2, 17}] (* Michael De Vlieger, Apr 24 2017 *)

A126589 Numbers n>1 such that prime of the form (n^k-1)/(n-1) does not exist for k>2; or A128164(n) = 0.

Original entry on oeis.org

4, 9, 16, 25, 32, 36, 49, 64, 81, 100, 121, 125, 144, 169, 196, 216, 225, 243, 256, 289, 324, 343, 361, 400, 441, 484, 529, 576, 625, 676, 729, 784, 841, 900, 961, 1000, 1024, 1089, 1156, 1225, 1296, 1369, 1444, 1521, 1600, 1681, 1728, 1764, 1849, 1936, 2025
Offset: 1

Views

Author

Alexander Adamchuk, Mar 13 2007

Keywords

Comments

Appears to be the union of the perfect squares k^2 (for k>1) and the prime powers p^k (for k>1) with some exceptions, such as 2^3, 3^3, 2^7, etc.
The perfect powers except those of the form n^(p^m) where p and (n^(p^(m+1))-1)/(n^(p^m)-1) are primes, p>2 and m>=1. - Max Alekseyev, Mar 09 2009

Examples

			A128164 begins with offset 2: {3, 3, 0, 3, 3, 5, 3, 0, 19, 17, 3, 5, 3, 3, 0, 3, ...}. Thus a(1) = 4, a(2) = 9, a(3) = 16.
		

Crossrefs

Extensions

Extended by Max Alekseyev, Mar 09 2009

A096059 Numbers n such that for all k, (n^k-1)/(n-1) is not prime.

Original entry on oeis.org

9, 25, 32, 49, 64, 81, 121, 125, 144
Offset: 1

Views

Author

Amarnath Murthy, Jun 17 2004

Keywords

Comments

Indices of 0 in A084740.
Possibly a subset of A001597.
The first unknown value is n=152, checked up to k = prime(1100). - Derek Orr, Nov 29 2014
It is known 169, 216, 225, 243, 289, 324, 343 are also members of this sequence. - Derek Orr, Nov 29 2014

Crossrefs

Extensions

Edited by Don Reble, Mar 19 2007

A133857 Numbers k such that (18^k - 1)/17 is prime.

Original entry on oeis.org

2, 25667, 28807, 142031, 157051, 180181, 414269, 1270141
Offset: 1

Views

Author

Alexander Adamchuk, Sep 28 2007

Keywords

Comments

Repunits in base 18 are off to a slow start compared with all the repunits in bases from -20 to 20. There are only 4 repunit primes in base 18 with exponents searched up to 150,000 while most other bases have 7-10 by then. Even after scaling the rate by logb logb, this is relatively low. - Paul Bourdelais, Mar 12 2010
With the discovery of a(6), this sequence of base-18 repunits is converging nicely to a rate close to Euler's constant with G=0.6667. - Paul Bourdelais, Mar 17 2010
With the discovery of a(7), G=0.54789, which is very close to the expected constant 0.56145948 mentioned in the Generalized Repunit Conjecture below. - Paul Bourdelais, Dec 08 2014

Examples

			a(1) = A084740(18) = 2,
a(2) = A128164(18) = 25667.
		

Crossrefs

Cf. A128164 (least k>2 such that (n^k-1)/(n-1) is prime).
Cf. A084740 (least k such that (n^k-1)/(n-1) is prime).
Cf. A126589 (numbers n>1 such that prime of the form (n^k-1)/(n-1) does not exist for k>2).

Programs

Extensions

a(2) = 25667 and a(3) = 28807 found by Henri Lifchitz, Sep 2007
a(4) corresponds to a probable prime discovered by Paul Bourdelais, Mar 12 2010
a(5) corresponds to a probable prime discovered by Paul Bourdelais, Mar 15 2010
a(6)=180181, previously discovered by Andy Steward in April 2007 in the form of the cyclotomic number Phi(180181,18), added by Paul Bourdelais, Mar 23 2010
a(7) corresponds to a probable prime discovered by Paul Bourdelais, Dec 08 2014
a(8) from Paul Bourdelais, Dec 02 2021

A246005 Least k such that ((2n+1)^k-1)/2n is prime, or 0 if no such k exists.

Original entry on oeis.org

3, 3, 5, 0, 17, 5, 3, 3, 19, 3, 5, 0, 3, 5, 7, 3, 313, 13, 349, 3, 5, 19, 127, 0, 4229, 11, 17, 3, 3, 7, 5, 19, 19, 3, 3, 5, 3, 3, 5, 0, 5, 5, 7, 3, 4421, 7, 7, 17, 3, 3, 19, 3, 17, 17, 3, 23, 7, 3, 3, 0, 43, 0, 5, 5, 3, 13, 1171, 11, 163, 3, 3, 5, 3, 7, 13, 3, 3, 17, 13, 3, 7, 5, 3, 0, 181, 3, 5, 5, 19, 17, 223
Offset: 1

Views

Author

Eric Chen, Nov 13 2014

Keywords

Comments

a(92) > 10000, a(93)..a(133) = {37, 3, 17, 5, 11, 31, 577, 271, 3, 19, 13, 3, 41, 137, 3, 281, 13, 7, 239, 0, 5, 11, 3, 113, 7, 7, 5, 17, 0, 3, 17, 5, 7, 19, 5, 23, 2011, 31, 5, 5, 13}, a(134) > 10000, a(135)..a(139) = {41, 37, 5, 5, 3}, a(140) > 10000, a(141)..a(150) = {29, 5, 3, 0, 13, 3, 17, 17, 113, 193}.

Examples

			a(23) = 127 because 2 * 23 + 1 = 47, (47^k-1)/46 is composite for k = 2, 3, ..., 126 and prime for k = 127.
		

Crossrefs

Programs

  • PARI
    a(n) = {l=List([4, 12, 24, 40, 60, 62, 84]); for(q=1, 91, if(n==l[q], return(0))); k=1; while(k, s=((2*n+1)^prime(k)-1)/(2*n); if(ispseudoprime(s), return(prime(k))); k++)} \\ Eric Chen, Nov 14 2014

Formula

a(n) = A084740(2n+1).
Previous Showing 11-15 of 15 results.