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-3 of 3 results.

A259145 Numbers k such that k^2 - phi(k) is prime, where phi() is A000010.

Original entry on oeis.org

2, 3, 7, 13, 33, 35, 65, 67, 77, 79, 91, 133, 139, 151, 163, 193, 221, 247, 249, 287, 299, 321, 337, 341, 349, 377, 379, 437, 457, 481, 533, 541, 551, 561, 581, 591, 595, 611, 613, 643, 721, 727, 763, 769, 779, 789, 803, 817, 843, 851, 869, 917, 919, 991
Offset: 1

Views

Author

Keywords

Comments

Conjecture: a(n) is a cyclic number (see A003277) for all n.
A065508 is the subsequence of prime terms. - Michel Marcus, Jun 19 2015

Examples

			a(1) = 2, since phi(2) = 1, thus 2^2 - 1 = 3 (prime).
a(3) = 7, since phi(7) = 6, thus 7^2 - 6 = 43 (prime).
a(5) = 33, since phi(33) = 20, thus 33^2 - 20 = 1069 (prime).
		

Crossrefs

Programs

  • Magma
    [n: n in [1..1000] | IsPrime(n^2 - EulerPhi(n))]; // Vincenzo Librandi, Jun 21 2015
    
  • Mathematica
    Select[Range[2000], PrimeQ[#^2 - EulerPhi[#]] &]
  • PARI
    main(size)={ v=vector(size); i=0; m=1; while(iAnders Hellström, Jul 08 2015 */

A258436 Primes p of form x^2 - phi(x) such that (p-1)/tau(p-1) is also prime.

Original entry on oeis.org

157, 1069, 61837, 190573, 840109, 1950349, 2485453, 20616397, 38844349, 57648589, 133091053, 144685357, 188582029, 222029869, 276773389, 346282477, 399067213, 472656589, 827175949, 929558797, 1137622957, 1352220109, 1369037389
Offset: 1

Views

Author

Keywords

Comments

Intersection of A252021 and A258435.

Crossrefs

Programs

  • Mathematica
    lst = Table[n^2 - EulerPhi[n], {n, 100000}]; Select[lst, PrimeQ[#] && PrimeQ[ ( # - 1)/DivisorSigma[0, # - 1] ] &]
  • PARI
    lista(nn) = {for (n=1, nn, if (isprime(p=n^2-eulerphi(n)) && (pp=p-1) && (type(r=pp/numdiv(pp))=="t_INT") && isprime(r), print1(p, ", ")););} \\ Michel Marcus, Jul 08 2015

A264771 Primes of the form n^2 + phi(n).

Original entry on oeis.org

2, 5, 11, 29, 131, 181, 233, 379, 991, 1109, 1249, 1721, 2633, 2861, 3539, 4273, 6971, 8009, 8353, 10301, 10711, 13313, 17291, 19973, 22349, 26053, 26731, 32941, 34369, 35129, 36671, 37441, 39799, 47269, 49033, 54521, 58321, 69431, 79241, 82609, 87257
Offset: 1

Views

Author

Vincenzo Librandi, Nov 24 2015

Keywords

Examples

			The prime 29 is in sequence because 29 = 5^2 + phi(5).
		

Crossrefs

Programs

  • Magma
    [a: n in [1..300] | IsPrime(a) where a is n^2 + EulerPhi(n)];
    
  • Mathematica
    Select[Table[n^2 + EulerPhi[n], {n, 500}], PrimeQ]
  • PARI
    for(n=1, 1e3, if(isprime(k=n^2 + eulerphi(n)), print1(k, ", "))) \\ Altug Alkan, Nov 24 2015
Showing 1-3 of 3 results.