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.

A104321 Smallest number m such that A104320(m)=n.

Original entry on oeis.org

0, 5, 8, 18, 13, 26, 27, 23, 42, 25, 37, 58, 47, 46, 61, 67, 54, 71, 77, 73, 88, 99, 141, 100, 115, 114, 119, 117, 113, 112, 109, 135, 110, 127, 133, 136, 164, 162, 177, 186, 193, 195, 163, 189, 201, 196, 191, 199, 206, 188, 208, 200, 221, 266, 235, 234, 238, 280
Offset: 0

Views

Author

Reinhard Zumkeller, Mar 01 2005

Keywords

Comments

A104320(a(n))=n and A104320(m)<>n for m
If it exists, a(115) > 10^5. - Michel Marcus, Oct 19 2016

Crossrefs

Programs

  • PARI
    a(n) = {my(k = 0); while (#select(x->(x==0), digits(2^k, 3)) != n, k++); k;} \\ Michel Marcus, Oct 19 2016