cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A096291 Sum of digits(product of nonzero digits(n^n)).

Original entry on oeis.org

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
Offset: 1

Views

Author

Jason Earls, Jun 24 2004

Keywords

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.

Crossrefs