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.

A166507 Least n-comma number: smallest nonnegative integer that occurs in the sequence S[k+1]=S[k]+10*last_digit(S[k-1])+first_digit(S[k]) for at least n different splittings a(n)=concat(S[0],S[1]).

Table of values

n a(n)
0 0
1 10
2 1023
3 2676
4 16867
5 111688
6 1522828
7 11386882
8 112273999
9 1212143716
10 11232152998
11 121321194596

List of values

[0, 10, 1023, 2676, 16867, 111688, 1522828, 11386882, 112273999, 1212143716, 11232152998, 121321194596]

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

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