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.

A328984 If n is even, a(n) = floor((5t+1)/2) where t=n/2; if n == 1 (mod 4) then a(n) = 10t+1 where t = (n-1)/4; and if n == 3 (mod 4) then a(n) = 10t+7 where t = (n-3)/4.

Table of values

n a(n)
1 1
2 3
3 7
4 5
5 11
6 8
7 17
8 10
9 21
10 13
11 27
12 15
13 31
14 18
15 37
16 20
17 41
18 23
19 47
20 25
21 51
22 28
23 57
24 30
25 61
26 33
27 67
28 35
29 71
30 38
31 77
32 40
33 81
34 43
35 87
36 45
37 91
38 48
39 97
40 50
41 101
42 53
43 107
44 55
45 111
46 58
47 117
48 60
49 121
50 63
51 127
52 65
53 131
54 68
55 137
56 70
57 141
58 73
59 147
60 75
61 151
62 78

List of values

[1, 3, 7, 5, 11, 8, 17, 10, 21, 13, 27, 15, 31, 18, 37, 20, 41, 23, 47, 25, 51, 28, 57, 30, 61, 33, 67, 35, 71, 38, 77, 40, 81, 43, 87, 45, 91, 48, 97, 50, 101, 53, 107, 55, 111, 58, 117, 60, 121, 63, 127, 65, 131, 68, 137, 70, 141, 73, 147, 75, 151, 78]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.