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 21-22 of 22 results.

A092408 Numbers k that divide 3^(k^3) + 1.

Original entry on oeis.org

1, 2, 34, 386, 578, 6562, 9826, 74498, 111554, 167042, 1100546, 1192354, 1266466, 1896418, 2839714, 14378114, 18709282, 20270018, 21529922, 32239106, 35759426, 48275138, 191812802, 212405378, 230124322, 244427938, 318057794, 344590306
Offset: 1

Views

Author

Robert G. Wilson v, Apr 02 2004

Keywords

Comments

It appears that all numbers of the form 2*17^m are present.

Crossrefs

Programs

  • Mathematica
    Select[ Range[ 350000000], PowerMod[3, #^3, # ] +1 == # &]

A093666 Numbers n such that n | 3^n^2 + 1.

Original entry on oeis.org

1, 2, 82, 3362, 137842, 188354, 5651522, 7722514, 13232914, 231712402, 316623074, 432649138, 542549474, 1196468642, 2650762258, 9500208482, 12981546034, 17738614658, 22244528434, 30396003458, 49055214322, 108681252578, 389508547762, 532243387394, 727283200978, 912025665794, 993795069986
Offset: 1

Views

Author

Robert G. Wilson v, Apr 02 2004

Keywords

Comments

If n is a term and p is its odd prime divisor, then p*n is also a term. In particular, the sequence contains 2*41^k and 2*41*2297^k for all k>=1.

Crossrefs

Programs

  • Mathematica
    Select[ Range[ 250000000], PowerMod[3, #^2, # ] +1 == # & ]

Extensions

Terms a(11) onward from Max Alekseyev, Feb 13 2012
Previous Showing 21-22 of 22 results.