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.

A064137 Number of divisors of 12^n + 1 that are relatively prime to 12^m + 1 for all 0 < m < n.

Original entry on oeis.org

2, 2, 4, 4, 4, 2, 2, 4, 8, 4, 2, 2, 4, 8, 4, 8, 4, 4, 4, 8, 16, 8, 16, 8, 8, 16, 8, 32, 2, 4, 2, 4, 4, 32, 4, 2, 8, 8, 8, 16, 2, 16, 2, 16, 4, 8, 2, 16, 8, 4, 32, 16, 8, 16, 32, 16, 64, 16, 32, 32, 4, 16, 16, 16, 32, 8, 16, 8, 8, 64, 16, 4, 16, 16, 64, 64, 8, 4, 8
Offset: 0

Views

Author

Robert G. Wilson v, Sep 10 2001

Keywords

Crossrefs

Programs

  • Mathematica
    a = {1}; Do[ d = Divisors[ 12^n + 1 ]; l = Length[ d ]; c = 0; k = 1; While[ k < l + 1, If[ Union[ GCD[ a, d[ [ k ] ] ] ] == {1}, c++ ]; k++ ]; Print[ c ]; a = Union[ Flatten[ Append[ a, Transpose[ FactorInteger[ 12^n + 1 ] ][ [ 1 ] ] ] ] ], {n, 0, 48} ]
  • PARI
    a(n) = if (n==0, 2, sumdiv(12^n+1, d, vecsum(vector(n-1, k, gcd(d, 12^k+1) == 1)) == n-1)); \\ Michel Marcus, Jun 24 2018

Extensions

More terms from Michel Marcus, Jul 02 2018