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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A225190 (n+2)^(n+2) mod n^n. 0
0, 0, 0, 20, 64, 1668, 27712, 355279, 779264, 170190707, 6100448256, 159424073982, 2545667031040, 239361355053790, 812743283245056, 58702956893404802, 17949710147773530112, 488189490082385976772, 38768887410023899070464, 313775221076492698014434, 11531764219557396646723584 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

The sequence of indices of odd terms b(n) begins: 7, 9, 25, 27, 39, 43, 45, 49, 53, 57, 59, 65, 67, 71, ...

a(n) may be odd only if n is odd. For even n's, both (n+2)^(n+2) and n^n are even, therefore a(n) is even.

c(n) = (b(n)-1)/2 begins: 3, 4, 12, 13, 19, 21, 22, 24, 26, 28, 29, 32, 33, 35, 36, 37, 38, 41, ...

LINKS

Table of n, a(n) for n=0..20.

EXAMPLE

a(3) = 5^5 mod 3^3 = 3125 mod 27 = 20.

PROG

(Python)

for i in range(21):  print str((i+2)**(i+2) % (i**i))+', ',

CROSSREFS

Cf. A066611, A176823, A176824.

Sequence in context: A187156 A246877 A074632 * A228839 A158444 A235281

Adjacent sequences:  A225187 A225188 A225189 * A225191 A225192 A225193

KEYWORD

nonn,less

AUTHOR

Alex Ratushnyak, May 01 2013

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 December 13 19:20 EST 2017. Contains 295976 sequences.