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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096291 (Sum of digits(product of nonzero digits(n^n)). 0
1, 4, 5, 6, 3, 9, 18, 27, 27, 1, 18, 27, 18, 9, 45, 27, 54, 54, 63, 15, 45, 72, 81, 72, 72, 81, 126, 72, 72, 27, 63, 81, 90, 81, 117, 99, 135, 135, 117, 54, 171, 144, 135, 144, 126, 171, 225, 126, 180, 72, 207, 162, 126, 162, 180, 198, 207, 234, 234, 135, 225, 207, 225, 270 (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=2577, i.e. sd(pnd(2577^2577)) = sd(pnd(2578^2578)) = 18315.

LINKS

Table of n, a(n) for n=1..64.

CROSSREFS

Cf. A051801, A007953.

Sequence in context: A276036 A010665 A200362 * A201933 A016719 A196999

Adjacent sequences:  A096288 A096289 A096290 * A096292 A096293 A096294

KEYWORD

base,easy,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Jun 24 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 7 13:07 EST 2016. Contains 278875 sequences.