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.

A284814 Least number k such that k mod (2, 3, 4, ... , n+1) = (d_1, d_2, ..., d_n), where d_1 , d_2, …, d_n are the digits of n, with MSD(n) = d_1 and LSD(n) = d_n. 0 if such a number does not exist.

Table of values

n a(n)
1 1
2 0
3 0
4 0
5 11311
6 0
7 1032327
8 11121217
9 101033565
10 0
11 10333633323
12 0
13 0
14 11121314781937
15 0

List of values

[1, 0, 0, 0, 11311, 0, 1032327, 11121217, 101033565, 0, 10333633323, 0, 0, 11121314781937, 0]

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

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