Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068955
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068955 Greatest prime factor of n^n-(n-1)^(n-1). +0
5
3, 23, 229, 151, 431, 776887, 14731, 109, 80317, 275311670611, 19395030961, 10423708597, 968299894201, 19428121, 165218809021364149, 808793517812627212561 (list; graph; listen)
OFFSET

2,1

FORMULA

a(n)=A006530(A007781(n)).

EXAMPLE

A007781(14) = 10809131718965763 = 3 * 61^2 * 968299894201, therefore a(14) = 968299894201.

CROSSREFS

Cf. A068954, A068956.

Sequence in context: A093135 A093162 A068954 this_sequence A151393 A007781 A068146

Adjacent sequences: A068952 A068953 A068954 this_sequence A068956 A068957 A068958

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 11 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research