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.

This page as a plain text file.
%I A125074 #2 Mar 31 2012 13:20:33
%S A125074 1,29,3343,407889491,298572057493,454195874136455153,
%T A125074 855210316410864290683,6009294624226370518329498431,
%U A125074 453664960868214198206218533253007296517
%N A125074 A051442[p-2]/p for p = Prime[n]>2.
%C A125074 A051442(n) = n^(n+1)+(n+1)^n. Odd prime p divides A051442(p-2).
%F A125074 a(n) = A051442[ Prime[n] - 2 ]/Prime[n] for n>1.
%t A125074 Table[((Prime[n]-2)^(Prime[n]-1)+(Prime[n]-1)^(Prime[n]-2))/Prime[n],{n,2,15}]
%Y A125074 Cf. A051442.
%K A125074 nonn
%O A125074 2,2
%A A125074 _Alexander Adamchuk_, Nov 18 2006