login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064232 a(n) = n^(n+2) mod (n+1)^(n+1). 2
0, 1, 16, 243, 971, 31469, 32530, 6799175, 298900846, 1381059609, 144064988167, 7774410799163, 72418038179852, 6737865711858693, 426377776285933636, 6292404967145601295, 586165173437961392811, 2993987233372099394609 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Harry J. Smith, Table of n, a(n) for n = 0..100

FORMULA

a(n) = n^(n+2) mod (n+1)^(n+1).

PROG

(PARI) { for (n=0, 100, write("b064232.txt", n, " ", n^(n + 2) % (n + 1)^(n + 1)) ) } \\ Harry J. Smith, Sep 10 2009

CROSSREFS

Sequence in context: A179092 A231020 A274856 * A074153 A119933 A274753

Adjacent sequences:  A064229 A064230 A064231 * A064233 A064234 A064235

KEYWORD

easy,nonn

AUTHOR

Floor van Lamoen, Sep 22 2001

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 13 13:15 EST 2018. Contains 317149 sequences. (Running on oeis4.)