A263255 -id:A263255 - cp's OEIS frontend

A263254 If A262693(n) = 1, then a(n) = 0, otherwise a(n) = 1 + a(A049820(n)).

0, 1, 0, 2, 2, 3, 0, 4, 3, 1, 1, 2, 0, 3, 2, 3, 3, 4, 0, 5, 3, 5, 0, 6, 4, 1, 1, 7, 1, 8, 0, 9, 2, 9, 0, 10, 8, 11, 1, 11, 3, 12, 0, 13, 2, 12, 0, 13, 2, 1, 3, 14, 1, 15, 0, 15, 3, 16, 0, 17, 3, 18, 0, 17, 17, 19, 1, 20, 1, 20, 0, 21, 4, 22, 1, 21, 1, 23, 0, 24, 1, 2, 1, 3, 5, 3, 2, 4, 2, 5, 0, 5, 3, 6, 0

Offset: 0

Antti Karttunen, Nov 07 2015

nonn

Distance of node n from the infinite trunk (A259934) of the tree defined by edge-relation A049820(child) = parent.

Zero-based row index to array A263255.

Antti Karttunen, Table of n, a(n) for n = 0..10002

One less than A263275.
Cf. A263257 (positions of records, where each n first occurs).
Cf. A000005, A049820, A155043, A259934, A262693, A262695, A262904, A263255, A263274.

If A262693(n) = 1 [when n is in A259934], then a(n) = 0, otherwise a(n) = 1 + a(A049820(n)).
a(n) = A155043(n) - A262904(n).
a(n) = A263275(n) - 1.

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

Antti Karttunen, Nov 07 2015

nonn

a(n) = least number k for which A263254(k) = n.

Also positions of records in A263254, thus the sequence is strictly increasing.

Antti Karttunen, Table of n, a(n) for n = 0..1835

Cf. A049820, A259934, A263254, A263258.

First column of array A263255.

cp's OEIS Frontend

A263254 If A262693(n) = 1, then a(n) = 0, otherwise a(n) = 1 + a(A049820(n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Formula