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.

A215453 a(n) = least k>0 such that n^n divides Fibonacci(k).

Table of values

n a(n)
1 1
2 6
3 36
4 192
5 3125
6 3888
7 941192
8 12582912
9 516560652
10 7500000000
11 259374246010
12 743008370688
13 163086595857367
14 1190572159881216
15 583858520507812500
16 13835058055282163712
17 437950726881001816329
18 3278867339608044797952
19 1874292305362402347591138
20 78643200000000000000000000
21 2225747435575612389097571208

List of values

[1, 6, 36, 192, 3125, 3888, 941192, 12582912, 516560652, 7500000000, 259374246010, 743008370688, 163086595857367, 1190572159881216, 583858520507812500, 13835058055282163712, 437950726881001816329, 3278867339608044797952, 1874292305362402347591138, 78643200000000000000000000, 2225747435575612389097571208]