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.

A263135 The maximum number of penny-to-penny connections when n pennies are placed on the vertices of a hexagonal tiling.

Table of values

n a(n)
0 0
1 0
2 1
3 2
4 3
5 4
6 6
7 7
8 8
9 9
10 11
11 12
12 13
13 15
14 16
15 17
16 19
17 20
18 21
19 23
20 24
21 25
22 27
23 28
24 30
25 31
26 32
27 34
28 35
29 36
30 38
31 39
32 41
33 42
34 43
35 45
36 46
37 48
38 49
39 50
40 52
41 53
42 55
43 56
44 57
45 59
46 60
47 62
48 63
49 64
50 66
51 67
52 69
53 70
54 72
55 73
56 74
57 76
58 77
59 79
60 80
61 81
62 83
63 84
64 86
65 87
66 89
67 90

List of values

[0, 0, 1, 2, 3, 4, 6, 7, 8, 9, 11, 12, 13, 15, 16, 17, 19, 20, 21, 23, 24, 25, 27, 28, 30, 31, 32, 34, 35, 36, 38, 39, 41, 42, 43, 45, 46, 48, 49, 50, 52, 53, 55, 56, 57, 59, 60, 62, 63, 64, 66, 67, 69, 70, 72, 73, 74, 76, 77, 79, 80, 81, 83, 84, 86, 87, 89, 90]

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

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