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.

A183423 Ordering of the numbers in tree A183421; complement of A183422.

Original entry on oeis.org

1, 3, 5, 7, 8, 10, 11, 13, 15, 17, 19, 21, 23, 24, 26, 28, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 48, 50, 52, 54, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 80, 82, 84, 86, 88, 89, 91, 93, 95, 97, 98, 99, 101, 103, 105, 107, 108, 109, 111, 113, 115, 117, 118, 120, 122, 124, 126, 128, 129, 131, 133, 135, 137, 139, 140, 142, 143, 145, 147, 149, 151, 152, 154, 155, 157, 159, 161, 163, 164, 166, 167, 168, 170, 172, 174, 176, 177, 179, 180, 181, 183, 185, 187, 189, 190, 192, 193, 195, 197, 199
Offset: 1

Views

Author

Clark Kimberling, Jan 04 2011

Keywords

Examples

			See A183422.
		

Crossrefs

Programs

  • Mathematica
     nn=200; t={1}; t0=t; While[t=Select[Union[t, (t^2+4t+2), t+Floor[1/2+(t+2)^(1/2)]], #<=nn&]; t0 !=t, t0=t]; t

Formula

The monotonic ordering of the numbers in the set S generated by these rules: 1 is in S, and if n is in S, then n^2+4*n+2 and n+Floor[1/2+sqrt(n+2)] is in S.