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.

Showing 1-2 of 2 results.

A026145 a(n) = s(k), where k is the n-th number such that s(j) < s(k) for all j < k, where s = A026142. Also a(n) = 2*t(n) for n >= 2, where t = A026144.

Original entry on oeis.org

1, 4, 8, 12, 14, 20, 24, 26, 32, 36, 38, 42, 44, 50, 56, 60, 62, 68, 72, 74, 78, 80, 86, 92, 96, 98, 104, 108, 110, 114, 116, 122, 126, 128, 132, 134, 140, 146, 150, 152, 158, 164, 168, 170, 176, 180, 182, 186, 188, 194, 200, 204, 206, 212, 216, 218, 222
Offset: 1

Views

Author

Keywords

Crossrefs

A026230 a(n) = (1/3)*s(n+1), where s = A026229.

Original entry on oeis.org

2, 4, 6, 7, 10, 12, 13, 16, 18, 19, 21, 22, 25, 28, 30, 31, 34, 36, 37, 39, 40, 43, 46, 48, 49, 52, 54, 55, 57, 58, 61, 63, 64, 66, 67, 70, 73, 75, 76, 79, 82, 84, 85, 88, 90, 91, 93, 94, 97, 100, 102, 103, 106, 108, 109, 111, 112, 115, 117
Offset: 1

Views

Author

Keywords

Crossrefs

Cf. A026144. [From R. J. Mathar, Oct 23 2008]
Showing 1-2 of 2 results.