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.

A125074 A051442[p-2]/p for p = Prime[n]>2.

Original entry on oeis.org

1, 29, 3343, 407889491, 298572057493, 454195874136455153, 855210316410864290683, 6009294624226370518329498431, 453664960868214198206218533253007296517
Offset: 2

Views

Author

Alexander Adamchuk, Nov 18 2006

Keywords

Comments

A051442(n) = n^(n+1)+(n+1)^n. Odd prime p divides A051442(p-2).

Crossrefs

Cf. A051442.

Programs

  • Mathematica
    Table[((Prime[n]-2)^(Prime[n]-1)+(Prime[n]-1)^(Prime[n]-2))/Prime[n],{n,2,15}]

Formula

a(n) = A051442[ Prime[n] - 2 ]/Prime[n] for n>1.