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

A297413 Numbers k such that 2^m == 2 (mod m*(m-1)), where m=A019320(k).

Original entry on oeis.org

2, 3, 6, 7, 14, 19, 38, 42, 43, 86, 114, 127, 163, 254, 258, 326, 379, 487, 758, 762, 883, 974, 978, 1459, 1766, 2274, 2647, 2918, 2922, 3079, 3943, 5294, 5298, 5419, 6158, 7886, 8754, 9199, 10838, 11827, 14407, 15882, 16759, 18398, 18474, 18523, 23654, 23658, 24967, 26407, 28814, 32514, 33518, 37046, 37339, 39367
Offset: 1

Views

Author

Max Alekseyev, Dec 29 2017

Keywords

Comments

Also, numbers k such that A019320(k) belongs to A069051 or A217468.

Crossrefs

Contains A297412 as a subsequence.

Programs

  • PARI
    is_A297413(k) = my(m=polcyclo(k,2)); Mod(2,m*(m-1))^m==2;

A297415 Numbers k such that A019320(k) is in A217465.

Original entry on oeis.org

25, 36, 52, 92, 124, 306, 361, 630, 656, 1648, 1780, 2508, 3300, 3540, 5728, 6260, 6450, 7500, 10820, 12656, 14076, 14132, 18836, 20960, 23456, 24272, 35280, 43136
Offset: 1

Views

Author

Max Alekseyev, Dec 29 2017

Keywords

Crossrefs

Set difference of A297414 and ({1} U A072226).

Programs

  • PARI
    is_A297415(n) = my(m=polcyclo(n, 2)); (m>1) && Mod(2, m*(m+1))^m==2 && !ispseudoprime(m);
Showing 1-2 of 2 results.