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.

A224523 Let {f_n(k)} be the n-th sequence of Fibonacci-like numbers defined by recursion f_n(0) = 0, f_n(1) = 1 and, for k>=2, f_n(k) = f_n(k-1) + f_n(k-2) divided by maximal possible powers of primes >= prime(n). a(n) is length of the smallest period of {f_n(k)}, and a(n)=0, if {f_n(k)} is not eventually periodic.

Table of values

n a(n)
1 1
2 3
3 6
4 9
5 9
6 12
7 15
8 27
9 12
10 12
11 15
12 15
13 15
14 15
15 15
16 15
17 15
18 42
19 42
20 42
21 42
22 42
23 42
24 90
25 72
26 36
27 36
28 36
29 36
30 36
31 36
32 36
33 36
34 36
35 54
36 54
37 66
38 102
39 102
40 102
41 102
42 102
43 102
44 102
45 102
46 36
47 36
48 36
49 36
50 36
51 36
52 24
53 24
54 24
55 24
56 24
57 24
58 24
59 24
60 24
61 24
62 24
63 24
64 24

List of values

[1, 3, 6, 9, 9, 12, 15, 27, 12, 12, 15, 15, 15, 15, 15, 15, 15, 42, 42, 42, 42, 42, 42, 90, 72, 36, 36, 36, 36, 36, 36, 36, 36, 36, 54, 54, 66, 102, 102, 102, 102, 102, 102, 102, 102, 36, 36, 36, 36, 36, 36, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24]