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.

A147547 Smallest n-digit number m such that phi(10^n+1)=phi(m), gcd(10^n+1,m)=1 and 10 does not divide m, or zero if there is no such m.

Table of values

n a(n)
1 0
2 0
3 779
4 9991
5 90901
6 990001
7 9090901
8 94139561
9 681465373
10 9898047311
11 86925973487
12 979104060601
13 9080337988583
14 95255589092561
15 712493161316801
16 9926748805307137
17 90004044661864321
18 989999011990088281
19 9090909102763796801
20 97910150575731744097
21 713349371311332607153
22 9789743000892702875281
23 88299846937619669895601

List of values

[0, 0, 779, 9991, 90901, 990001, 9090901, 94139561, 681465373, 9898047311, 86925973487, 979104060601, 9080337988583, 95255589092561, 712493161316801, 9926748805307137, 90004044661864321, 989999011990088281, 9090909102763796801, 97910150575731744097, 713349371311332607153, 9789743000892702875281, 88299846937619669895601]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.