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.

A239640 a(n) is the smallest number such that for n-bonacci constant c_n satisfies round(c_n^prime(m)) == 1 (mod 2*p_m) for every m>=a(n).

Table of values

n a(n)
2 3
3 3
4 4
5 5
6 7
7 7
8 10
9 13
10 14
11 14
12 19
13 23
14 23
15 31
16 34
17 34
18 46
19 50
20 60
21 65
22 73
23 79
24 88
25 92
26 107
27 113
28 126
29 139
30 149
31 168
32 182
33 198
34 210
35 227
36 244
37 265
38 276
39 292
40 317
41 340
42 369
43 384
44 408
45 436
46 444
47 480
48 516
49 540
50 565
51 606
52 628
53 669
54 704
55 735
56 759
57 810
58 829
59 895
60 925

List of values

[3, 3, 4, 5, 7, 7, 10, 13, 14, 14, 19, 23, 23, 31, 34, 34, 46, 50, 60, 65, 73, 79, 88, 92, 107, 113, 126, 139, 149, 168, 182, 198, 210, 227, 244, 265, 276, 292, 317, 340, 369, 384, 408, 436, 444, 480, 516, 540, 565, 606, 628, 669, 704, 735, 759, 810, 829, 895, 925]