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.

Showing 1-4 of 4 results.

A062572 Numbers k such that 6^k - 5^k is prime.

Original entry on oeis.org

2, 5, 11, 13, 23, 61, 83, 421, 1039, 1511, 31237, 60413, 113177, 135647, 258413
Offset: 1

Views

Author

Mike Oakes, May 18 2001, May 19 2001

Keywords

Comments

The 809- and 1176-digit numbers associated with the terms 1039 and 1511 have been certified prime with Primo. - Rick L. Shepherd, Nov 15 2002

Examples

			2 is in the sequence because 6^2 - 5^2 = 36 - 25 = 11, which is prime.
3 is not in the sequence because 6^3 - 5^3 = 216 - 125 = 91 = 7 * 13, which is not prime.

Crossrefs

Cf. A000043, A057468, A059801, A059802, A062573-A062666.

Programs

  • Mathematica
    Select[Range[1000], PrimeQ[6^# - 5^#] &] (* Alonso del Arte, Sep 04 2013 *)
  • PARI
    forprime(p=2,1e4,if(ispseudoprime(6^n-5^n),print1(p", "))) \\ Charles R Greathouse IV, Jun 10 2011

Extensions

Edited by T. D. Noe, Oct 30 2008
Two more terms (31237 and 60413) found by Predrag Minovic in 2004 corresponding to probable primes with 24308 and 47011 digits. Jean-Louis Charton, Oct 06 2010
Two more terms (113177 and 135647) found by Jean-Louis Charton in 2009 corresponding to probable primes with 88069 and 105554 digits. Jean-Louis Charton, Oct 13 2010
a(15) from Jean-Louis Charton, Apr 08 2013

A147669 Primes of the form 7^k-6^k.

Original entry on oeis.org

13, 127, 543607, 3183060102526390833854311, 44487435359130133495783012898708551, 418364165757172442919546303805118823151668308251259902807
Offset: 1

Views

Author

Vladimir Joseph Stephan Orlovsky, Nov 10 2008

Keywords

Comments

7^2-6^2=49-36=13,...

Crossrefs

Cf. A062573

Programs

  • Mathematica
    lst={};Do[p=7^n-6^n;If[PrimeQ[p],AppendTo[lst,p]],{n,6!}];lst

A247093 Triangle read by rows: T(m,n) = smallest odd prime p such that (m^p-n^p)/(m-n) is prime (0

Original entry on oeis.org

3, 3, 3, 0, 0, 3, 3, 5, 13, 3, 3, 0, 0, 0, 5, 5, 3, 3, 5, 3, 3, 3, 0, 3, 0, 19, 0, 7, 0, 3, 0, 0, 3, 0, 3, 7, 19, 0, 3, 0, 0, 0, 31, 0, 3, 17, 5, 3, 3, 5, 3, 5, 7, 5, 3, 3, 0, 0, 0, 3, 0, 3, 0, 0, 0, 3, 5, 3, 7, 5, 5, 3, 7, 3, 3, 251, 3, 17, 3, 0, 5, 0, 151, 0, 0, 0, 59, 0, 5, 0, 3, 3, 5, 0, 1097, 0, 0, 3, 3, 0, 0, 7, 0, 17, 3
Offset: 1

Views

Author

Eric Chen, Nov 18 2014

Keywords

Comments

T(m,n) is 0 if and only if m and n are not coprime or A052409(m) and A052409(n) are not coprime. (The latter has some exceptions, like T(8,1) = 3. In fact, if p is a prime and does not equal to A052410(gcd(A052409(m),A052409(n))), then (m^p-n^p)/(m-n) is composite, so if it is not 0, then it is A052410(gcd(A052409(m),A052409(n))).) - Eric Chen, Nov 26 2014
a(i) = T(m,n) corresponds only to probable primes for (m,n) = {(15,4), (18,1), (19,18), (31,6), (37,22), (37,25), ...} (i={95, 137, 171, 441, 652, 655, ...}). With the exception of these six (m,n), all corresponding primes up to a(663) are definite primes. - Eric Chen, Nov 26 2014
a(n) is currently known up to n = 663, a(664) = T(37, 34) > 10000. - Eric Chen, Jun 01 2015
For n up to 1000, a(n) is currently unknown only for n = 664, 760, and 868. - Eric Chen, Jun 01 2015

Examples

			Read by rows:
m\n        1   2   3   4   5   6   7   8   9   10  11
2          3
3          3   3
4          0   0   3
5          3   5   13  3
6          3   0   0   0   5
7          5   3   3   5   3   3
8          3   0   3   0   19  0   7
9          0   3   0   0   3   0   3   7
10         19  0   3   0   0   0   31  0   3
11         17  5   3   3   5   3   5   7   5   3
12         3   0   0   0   3   0   3   0   0   0   3
etc.

Links

Crossrefs

Cf. A128164 (n,1), A125713 (n+1,n), A125954 (2n+1,2), A122478 (2n+1,2n-1).
Cf. A000043 (2,1), A028491 (3,1), A057468 (3,2), A059801 (4,3), A004061 (5,1), A082182 (5,2), A121877 (5,3), A059802 (5,4), A004062 (6,1), A062572 (6,5), A004063 (7,1), A215487 (7,2), A128024 (7,3), A213073 (7,4), A128344 (7,5), A062573 (7,6), A128025 (8,3), A128345 (8,5), A062574 (8,7), A173718 (9,2), A128346 (9,5), A059803 (9,8), A004023 (10,1), A128026 (10,3), A062576 (10,9), A005808 (11,1), A210506 (11,2), A128027 (11,3), A216181 (11,4), A128347 (11,5), A062577 (11,10), A004064 (12,1), A128348 (12,5), A062578 (12,11).

Programs

  • Mathematica
    t1[n_] := Floor[3/2 + Sqrt[2*n]]
m[n_] := Floor[(-1 + Sqrt[8*n-7])/2]
t2[n_] := n-m[n]*(m[n]+1)/2
b[n_] := GCD @@ Last /@ FactorInteger[n]
is[m_, n_] := GCD[m, n] == 1 && GCD[b[m], b[n]] == 1
Do[k=2, If[is[t1[n], t2[n]], While[ !PrimeQ[t1[n]^Prime[k] - t2[n]^Prime[k]], k++]; Print[Prime[k]], Print[0]], {n, 1, 663}] (* Eric Chen, Jun 01 2015 *)
  • PARI
    a052409(n) = my(k=ispower(n)); if(k, k, n>1);
a(m, n) = {if (gcd(m,n) != 1, return (0)); if (gcd(a052409(m), a052409(n)) != 1, return (0)); forprime(p=3,, if (isprime((m^p-n^p)/(m-n)), return (p)););}
tabl(nn) = {for (m=2, nn, for(n=1, m-1, print1(a(m,n), ", ");); print(););} \\ Michel Marcus, Nov 19 2014
  • PARI
    t1(n)=floor(3/2+sqrt(2*n))
t2(n)=n-binomial(floor(1/2+sqrt(2*n)), 2)
b(n)=my(k=ispower(n)); if(k, k, n>1)
a(n)=if(gcd(t1(n),t2(n)) !=1 || gcd(b(t1(n)), b(t2(n))) !=1, 0, forprime(p=3,2^24,if(ispseudoprime((t1(n)^p-t2(n)^p)/(t1(n)-t2(n))), return(p)))) \\ Eric Chen, Jun 01 2015

A220788 Numbers k such that 7^k + 6^k is prime.

Original entry on oeis.org

0, 1, 4, 16
Offset: 1

Views

Author

Vincenzo Librandi, Jan 10 2013

Keywords

Comments

Next term is > 15000 if it exists.
Next term is > 100000 if it exists. - Michael S. Branicky, Oct 10 2024

Crossrefs

Cf. A062573, A074619.

Programs

  • Magma
    /* The program does not work for n>2700: */ [n: n in [0..1000]| IsPrime(7^n + 6^n)];
  • Mathematica
    Join[{0, 1}, Select[2 Range[500], PrimeQ[7^# + 6^#] &]]
  • PARI
    for(n=0, 1000, if(isprime(7^n + 6^n), print1(n, ", ")))
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.