login
a(n) = n^r(n), where r(n) is the digital root of n.
0

%I #15 Sep 13 2024 11:55:19

%S 1,1,4,27,256,3125,46656,823543,16777216,387420489,10,121,1728,28561,

%T 537824,11390625,268435456,6975757441,198359290368,19,400,9261,234256,

%U 6436343,191102976,6103515625,208827064576,7625597484987,28,841,27000,923521,33554432

%N a(n) = n^r(n), where r(n) is the digital root of n.

%F a(n) = n^r(n).

%F for n>0, a(n) = n^(((n-1) mod 9)+1).

%e a(13)=13^r(13)=13^4=28561.

%p [1, seq(n^(((n-1) mod 9)+1),n=1..30)]; # _Georg Fischer_, Sep 11 2024

%t Join[{1},Table[n^(Mod[n-1,9]+1),{n,32}]] (* _James C. McMahon_, Sep 13 2024 *)

%Y Cf. A000312, A010888.

%K base,nonn,easy

%O 0,3

%A Luc Stevens (lms022(AT)yahoo.com), Apr 23 2006

%E a(28) corrected by _Georg Fischer_, Sep 11 2024