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-1 of 1 results.

A263257 a(n) = least number with distance n to the infinite trunk (A259934) of the tree defined by edge-relation A049820(child) = parent.

Original entry on oeis.org

0, 1, 3, 5, 7, 19, 23, 27, 29, 31, 35, 37, 41, 43, 51, 53, 57, 59, 61, 65, 67, 71, 73, 77, 79, 223, 231, 233, 237, 239, 241, 249, 251, 263, 267, 269, 271, 277, 285, 291, 293, 299, 303, 315, 317, 321, 327, 331, 335, 337, 341, 347, 349, 357, 359, 369, 857, 859, 1077, 1081, 1087, 1095, 1097, 1101
Offset: 0

Views

Author

Antti Karttunen, Nov 07 2015

Keywords

Comments

a(n) = least number k for which A263254(k) = n.
Also positions of records in A263254, thus the sequence is strictly increasing.

Crossrefs

First column of array A263255.
Showing 1-1 of 1 results.