login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A075877 Powering the decimal digits of n (left-associative). 4

%I #14 Mar 22 2015 09:19:36

%S 1,2,3,4,5,6,7,8,9,1,1,1,1,1,1,1,1,1,1,1,2,4,8,16,32,64,128,256,512,1,

%T 3,9,27,81,243,729,2187,6561,19683,1,4,16,64,256,1024,4096,16384,

%U 65536,262144,1,5,25,125,625,3125,15625,78125,390625,1953125,1,6,36,216,1296

%N Powering the decimal digits of n (left-associative).

%C See A256229 for the (maybe more natural) "right-associative" variant, a(xyz)=x^(y^z). a(n) = A256229(n) for n < 212 (up to 210, according to the 2nd formula which also holds for A256229), but (2^1)^2 = 4 while 2^(1^2) = 1. - _M. F. Hasler_, Mar 22 2015

%H Reinhard Zumkeller, <a href="/A075877/b075877.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = if n < 10 then n else a(floor(n\10))^(n mod 10).

%F a(n) = 1 iff the initial digit is 1 or n contains a 0 (i.e., A055641(n) > 0 or A000030(n) = 1);

%F a(A011540(n)) = 1.

%F a(n) = A133500(n) for n <= 99. - _Reinhard Zumkeller_, May 27 2013

%e a(253) = (2^5)^3 = 32^3 = 32768.

%o (Haskell)

%o a075877 n = if n < 10 then n else a075877 (n `div` 10) ^ (n `mod` 10)

%o -- _Reinhard Zumkeller_, May 27 2013

%o (PARI) A075877(n)=if(n>9,A075877(n\10)^(n%10),n) \\ _M. F. Hasler_, Mar 19 2015

%Y Cf. A007953, A007954.

%Y Cf. A185969, A248907, A256179.

%K nonn,base,hear,look

%O 1,2

%A _Reinhard Zumkeller_, Oct 16 2002

%E Formula corrected by _Reinhard Zumkeller_, May 27 2013

%E Edited by _M. F. Hasler_, Mar 22 2015

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 16:08 EDT 2024. Contains 371794 sequences. (Running on oeis4.)