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.

A326610 Least k such that A000790(k) = A108574(n).

Original entry on oeis.org

0, 3, 26, 11, 14, 59, 83, 23, 443, 338, 263, 578, 38, 662, 47, 227, 3467, 1823, 842, 4898, 983, 4622, 4847, 2747, 4127, 11567, 347, 542, 17483, 2867, 22367, 43067, 18527, 5042, 5063, 12422, 66047, 2858, 87302, 11702, 11147, 3062, 24602, 158, 94763, 247838, 1202
Offset: 1

Views

Author

Richard N. Smith, Jul 14 2019

Keywords

Comments

The largest term is a(106) = 10009487 (for the primary pretender 453).

Crossrefs