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.

A268962 a(1) = 1 and a(2) = 2; thereafter a(n+1) = floor[sqrt(a(n))] if not already in the sequence; otherwise a(n+1) = a(n) + a(n-1).

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 8
6 13
7 21
8 4
9 25
10 29
11 54
12 7
13 61
14 68
15 129
16 11
17 140
18 151
19 12
20 163
21 175
22 338
23 18
24 356
25 374
26 19
27 393
28 412
29 20
30 432
31 452
32 884
33 1336
34 36
35 6
36 42
37 48
38 90
39 9
40 99
41 108
42 10
43 118
44 128
45 246
46 15
47 261
48 16
49 277
50 293
51 17
52 310
53 327
54 637
55 964
56 31
57 995
58 1026
59 32

List of values

[1, 2, 3, 5, 8, 13, 21, 4, 25, 29, 54, 7, 61, 68, 129, 11, 140, 151, 12, 163, 175, 338, 18, 356, 374, 19, 393, 412, 20, 432, 452, 884, 1336, 36, 6, 42, 48, 90, 9, 99, 108, 10, 118, 128, 246, 15, 261, 16, 277, 293, 17, 310, 327, 637, 964, 31, 995, 1026, 32]