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.

A109756 If you sum 3 consecutive odd prime numbers p,q,r, you get a number s which is either prime or not: p+q+r=s. If s is prime, you call it p and repeat the game. If s is not prime, you call the largest prime factor p and repeat the game. Finally, you get into an infinite cycle, which is one of the above 3 sequences, no matter what initial prime numbers you choose.

Table of values

n a(n)
1 7
2 31
3 109
4 349
5 1061
6 103
7 29
8 97
9 43
10 13
11 11
12 41
13 131
14 37
15 17
16 59

List of values

[7, 31, 109, 349, 1061, 103, 29, 97, 43, 13, 11, 41, 131, 37, 17, 59]