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.

A246280 a(n) = the smallest starting value for k such that n will be the exact number of additional iterations of A003961 needed when we start from A003961(k) before we first reach a number of the form 4k+1; the least k such that A246271(k) = n.

Table of values

n a(n)
0 1
1 2
2 5
3 66
4 91
5 55
6 21
7 46
8 1362
9 1654
10 1419
11 574
12 6463
13 5263
14 4607
15 3497
16 589843
17 430261
18 574823
19 567583
20 554111
21 545869
22 20490043
23 14635735
24 8781429

List of values

[1, 2, 5, 66, 91, 55, 21, 46, 1362, 1654, 1419, 574, 6463, 5263, 4607, 3497, 589843, 430261, 574823, 567583, 554111, 545869, 20490043, 14635735, 8781429]