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

A182598 Number of prime factors of form cn+1 for numbers 6^n+1.

Original entry on oeis.org

1, 2, 1, 2, 3, 2, 2, 1, 2, 1, 2, 3, 2, 2, 3, 2, 4, 2, 2, 1, 3, 2, 2, 2, 3, 3, 4, 3, 6, 1, 3, 4, 2, 5, 5, 3, 2, 5, 4, 3, 4, 1, 2, 2, 4, 1, 5, 3, 3, 6, 3, 4, 5, 4, 4, 3, 2, 1, 3, 2, 1, 3, 3, 3, 8, 4, 4, 2, 4, 3, 1, 5, 3, 5, 4, 1, 7, 5, 3, 3, 3, 4, 5, 3, 4, 7, 2, 2, 7, 5, 3, 2, 4, 5, 2, 3, 2, 4, 6
Offset: 2

Views

Author

Seppo Mustonen, Nov 24 2010

Keywords

Comments

Repeated prime factors are counted.

Examples

			For n=6, 6^n-1=46655=5*7*31*43 has three prime factors of form, namely 7=n+1, 31=5n+1, 43=7n+1. Thus a(6)=3.
		

Programs

  • Mathematica
    m = 6; n = 2; nmax = 100;
    While[n <= nmax, {l = FactorInteger[m^n + 1]; s = 0;
         For[i = 1, i <= Length[l],
          i++, {p = l[[i, 1]];
           If[IntegerQ[(p - 1)/n] == True, s = s + l[[i, 2]]];}];
         a[n] = s;} n++;];
    Table[a[n], {n, 2, nmax}]
    Table[{p, e}=Transpose[FactorInteger[6^n+1]]; Sum[If[Mod[p[[i]], n] == 1, e[[i]], 0], {i, Length[p]}], {n, 2, 50}]

A182599 Number of prime factors of form cn+1 for numbers 7^n+1.

Original entry on oeis.org

2, 1, 1, 2, 2, 2, 2, 1, 2, 2, 4, 2, 1, 1, 2, 1, 2, 2, 3, 3, 3, 1, 1, 1, 2, 1, 4, 1, 4, 3, 3, 2, 3, 5, 4, 2, 1, 3, 3, 4, 2, 7, 3, 4, 4, 1, 3, 7, 4, 4, 3, 4, 3, 6, 5, 5, 4, 4, 3, 1, 3, 8, 3, 2, 5, 3, 3, 4, 4, 2, 5, 3, 1, 5, 5, 5, 4, 4, 3, 4, 3, 2, 5, 3, 3, 4, 2, 5, 4, 5, 4, 5, 3, 6, 6, 3, 5, 3, 3
Offset: 2

Views

Author

Seppo Mustonen, Nov 24 2010

Keywords

Comments

Repeated prime factors are counted.

Examples

			For n=12, 7^12+1=13841287202=2*73*193*409*1201 has four prime factors of form, namely 73=6n+1, 193=16n+1, 409=34n+1, 1201=100n+1. Thus a(12)=4.
		

Programs

  • Mathematica
    m = 7; n = 2; nmax = 100;
    While[n <= nmax, {l = FactorInteger[m^n + 1]; s = 0;
         For[i = 1, i <= Length[l],
          i++, {p = l[[i, 1]];
           If[IntegerQ[(p - 1)/n] == True, s = s + l[[i, 2]]];}];
         a[n] = s;} n++;];
    Table[a[n], {n, 2, nmax}]
    Table[{p,e}=Transpose[FactorInteger[7^n+1]]; Sum[If[Mod[p[[i]], n]==1, e[[i]], 0], {i, Length[p]}], {n, 2, 50}]
Previous Showing 11-12 of 12 results.