login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A125074 A051442[p-2]/p for p = Prime[n]>2. 1

%I #2 Mar 31 2012 13:20:33

%S 1,29,3343,407889491,298572057493,454195874136455153,

%T 855210316410864290683,6009294624226370518329498431,

%U 453664960868214198206218533253007296517

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

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

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

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

%Y Cf. A051442.

%K nonn

%O 2,2

%A _Alexander Adamchuk_, Nov 18 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 05:49 EDT 2024. Contains 371918 sequences. (Running on oeis4.)