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.

A096343 Number of 1's in binary expansion(product of nonzero digits(n^n)).

Original entry on oeis.org

1, 1, 3, 4, 4, 4, 4, 6, 6, 1, 6, 5, 10, 5, 16, 14, 12, 17, 22, 4, 9, 21, 21, 22, 18, 25, 22, 21, 15, 4, 27, 28, 29, 23, 32, 34, 39, 38, 52, 13, 45, 56, 50, 53, 27, 50, 44, 48, 47, 18, 48, 62, 42, 47, 48, 44, 57, 67, 58, 31, 71, 66, 63, 57, 71, 67, 56, 74, 70, 42, 100, 89, 72, 60, 75
Offset: 0

Views

Author

Jason Earls, Jun 29 2004

Keywords

Comments

Conjecture: a(n) = a(n+1) for infinitely many positive integers. Largest found is n=1091, i.e. n1b(pnd(1091^1091)) = n1b(pnd(1092^1092)) = 1892.

Crossrefs

Programs

  • Mathematica
    Table[Count[IntegerDigits[Times@@DeleteCases[IntegerDigits[n^n],0],2],1],{n,80}] (* Harvey P. Dale, Mar 08 2017 *)