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.

A366576 Sum of the divisors of 3^n-1.

Original entry on oeis.org

3, 15, 42, 186, 399, 1680, 3282, 15876, 31836, 123690, 277344, 1541568, 2391486, 8992680, 25483332, 111757968, 193819392, 967814400, 1744488660, 9366647892, 16912999320, 62424587520, 144219337920, 852903426816, 1397135488896, 4766016364260, 12477973754400
Offset: 1

Views

Author

Sean A. Irvine, Oct 13 2023

Keywords

Examples

			a(4)=186 because 3^4-1 has divisors {1, 2, 4, 5, 8, 10, 16, 20, 40, 80}.
		

Crossrefs

Programs

  • Maple
    a:=n->numtheory[sigma](3^n-1):
    seq(a(n), n=1..100);
  • Mathematica
    DivisorSigma[1,3^Range[30]-1] (* Paolo Xausa, Oct 15 2023 *)

Formula

a(n) = sigma(3^n-1) = A000203(A024023).

A366718 Largest prime factor of 12^n - 1.

Original entry on oeis.org

11, 13, 157, 29, 22621, 157, 4943, 233, 80749, 22621, 266981089, 20593, 20369233, 13063, 22621, 260753, 74876782031, 80749, 29043636306420266077, 85403261, 8177824843189, 57154490053, 321218438243, 2227777, 12629757106815551, 20369233, 86769286104133
Offset: 1

Views

Author

Sean A. Irvine, Oct 17 2023

Keywords

Crossrefs

Programs

  • Magma
    [Maximum(PrimeDivisors(12^n-1)): n in [1..40]];
  • Mathematica
    Table[FactorInteger[12^n - 1][[-1, 1]], {n, 40}]

Formula

a(n) = A006530(A024140(n)).
Previous Showing 11-12 of 12 results.