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.

A260724 a(1) = 2; for n > 1 if n mod 3=0 a(n) = gpf(1 + Product_{m modulo 3=2,m a(m)), if n modulo 3=1 a(n) = gpf(1 + Product_{m modulo 3=0,m a(m)), if n modulo 3=2 a(n) = gpf(1 + Product_{m modulo 3=1,m a(m)).

Table of values

n a(n)
1 2
2 3
3 2
4 7
5 5
6 2
7 31
8 3
9 109
10 13
11 97
12 83
13 8731
14 461
15 3078769
16 574933
17 206179
18 510583
19 5153873111
20 1900169
21 372828179
22 4032506435771041
23 3445362972116384083
24 49898596950715368948711529590337583
25 54176564592185030069557382121821

List of values

[2, 3, 2, 7, 5, 2, 31, 3, 109, 13, 97, 83, 8731, 461, 3078769, 574933, 206179, 510583, 5153873111, 1900169, 372828179, 4032506435771041, 3445362972116384083, 49898596950715368948711529590337583, 54176564592185030069557382121821]