login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A072967
Least k>n such that the last digit of k^k is the same as the last digit of n^n.
0
11, 18, 17, 6, 15, 8, 13, 12, 19, 20, 21, 14, 27, 16, 25, 24, 23, 22, 29, 30, 31, 38, 37, 26, 35, 28, 33, 32, 39, 40, 41, 34, 47, 36, 45, 44, 43, 42, 49, 50, 51, 58, 57, 46, 55, 48, 53, 52, 59, 60, 61, 54, 67, 56, 65, 64, 63, 62, 69, 70, 71, 78, 77, 66, 75, 68, 73, 72, 79, 80
OFFSET
1,1
FORMULA
a(n)=n+b(n) where b(n) is a periodic sequence with period (10, 16, 14, 2, 10, 2, 6, 4, 10, 10, 10, 2, 14, 2, 10, 8, 6, 4, 10, 10, 10) of length 21
MATHEMATICA
lkld[n_]:=Module[{ldn=Mod[n^n, 10], k=n+2}, While[Mod[k^k, 10]!=ldn, k=k+2]; k]; Array[lkld, 70] (* Harvey P. Dale, Feb 15 2015 *)
PROG
(PARI) a(n)=if(n<0, 0, s=n+1; while(abs(s^s%10-n^n%10)>0, s++); s)
CROSSREFS
Sequence in context: A257169 A162555 A059141 * A232658 A300062 A309489
KEYWORD
base,easy,nonn
AUTHOR
Benoit Cloitre, Aug 13 2002
STATUS
approved