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.

A113735 Let prime(0) = 1 and f(n) = product prime(d), where d ranges over all the decimal digits of n. The sequence gives numbers n such that f(n) == 0 (mod n).

Table of values

n a(n)
1 1
2 14
3 17
4 154
5 1196
6 26979
7 66079
8 279174
9 1698619
10 9397685
11 302768895
12 594963655
13 2249805789
14 6794867989
15 9785759929
16 75077778589
17 67471872963495
18 34976979277935695
19 275776822479793635
20 459267544887917766
21 34678475798796583278525

List of values

[1, 14, 17, 154, 1196, 26979, 66079, 279174, 1698619, 9397685, 302768895, 594963655, 2249805789, 6794867989, 9785759929, 75077778589, 67471872963495, 34976979277935695, 275776822479793635, 459267544887917766, 34678475798796583278525]