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.

A237671 Let m_n denote the number which is obtained from n-base representation of m if its digits are written in nondecreasing order; then a(n) is the smallest period of the sequence which is defined by the recurrence b(0)=0, b(1)=1, b(k)=(b(k-1) + b(k-2))_n, for k>=2, or a(n)=0, if there is no such period.

Table of values

n a(n)
2 1
3 3
4 16
5 6
6 20
7 24
8 16
9 36
10 120
11 300
12 20
13 288
14 28
15 192
16 200
17 552
18 180
19 192
20 180
21 1380
22 224
23 60
24 1728
25 912
26 3800
27 756
28 576
29 1776
30 4102
31 15480
32 3540
33 1344
34 10800
35 14328
36 800
37 2304
38 1520
39 1890
40 1232
41 11280
42 9040
43 31152
44 49544
45 3660
46 6360
47 3696
48 13248
49 21408

List of values

[1, 3, 16, 6, 20, 24, 16, 36, 120, 300, 20, 288, 28, 192, 200, 552, 180, 192, 180, 1380, 224, 60, 1728, 912, 3800, 756, 576, 1776, 4102, 15480, 3540, 1344, 10800, 14328, 800, 2304, 1520, 1890, 1232, 11280, 9040, 31152, 49544, 3660, 6360, 3696, 13248, 21408]