This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A096301 (Product of nonzero digits(sum of digits(n^n)). 1
 1, 4, 9, 3, 1, 14, 10, 21, 20, 1, 4, 20, 40, 10, 81, 64, 72, 8, 14, 3, 7, 32, 24, 15, 5, 20, 72, 18, 42, 18, 32, 10, 14, 8, 12, 14, 14, 60, 18, 2, 24, 15, 9, 30, 18, 30, 84, 27, 75, 5, 16, 8, 15, 168, 32, 27, 20, 56, 28, 24, 128, 20, 180, 224, 70, 15, 60, 120, 196, 90, 144, 200, 24 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Conjecture: a(n) = a(n+1) for infinitely many positive integers. Largest found is n=4462, i.e. pnd(sd(4462^4462)) = pnd(sd(4463^4463)) = 126. LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 MATHEMATICA Array[Times@@Select[IntegerDigits[Total[IntegerDigits[#^#]]], #>0&]&, 80] (* Harvey P. Dale, Sep 30 2012 *) CROSSREFS Cf. A051801, A007953. Sequence in context: A136271 A113970 A021957 * A196819 A296448 A217316 Adjacent sequences:  A096298 A096299 A096300 * A096302 A096303 A096304 KEYWORD base,easy,nonn AUTHOR Jason Earls, Jun 25 2004 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 16 19:43 EDT 2019. Contains 324155 sequences. (Running on oeis4.)