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.

A276348 a(n) = the smallest number k such that k*n is a number with a string of 1's followed by a string of 0's.

Table of values

n a(n)
1 10
2 5
3 370
4 25
5 2
6 185
7 158730
8 125
9 123456790
10 1
11 10
12 925
13 85470
14 79365
15 74
16 625
17 653594771241830
18 61728395
19 58479532163742690
20 5
21 52910
22 5
23 483091787439613526570
24 4625
25 4
26 42735
27 41152263374485596707818930
28 396825
29 383141762452107279693486590
30 37

List of values

[10, 5, 370, 25, 2, 185, 158730, 125, 123456790, 1, 10, 925, 85470, 79365, 74, 625, 653594771241830, 61728395, 58479532163742690, 5, 52910, 5, 483091787439613526570, 4625, 4, 42735, 41152263374485596707818930, 396825, 383141762452107279693486590, 37]