A278489 Nonleaves in the tree defined by edge relation A255131(child) = parent, the least squares beanstalk.

0, 3, 6, 8, 9, 11, 15, 16, 18, 19, 21, 24, 27, 30, 32, 35, 38, 39, 40, 41, 43, 45, 48, 50, 51, 53, 54, 56, 59, 63, 64, 66, 67, 70, 71, 72, 73, 74, 75, 78, 80, 81, 83, 85, 87, 88, 90, 91, 93, 95, 96, 99, 102, 104, 105, 107, 108, 111, 112, 114, 115, 117, 120, 123, 126, 128, 129, 130, 131, 134, 135, 136, 137, 138, 139, 143, 144

Offset

0,2

Comments

Numbers n for which there exists at least one such integer k that k - A002828(k) = n, in other words, numbers n such that either A002828(1+n) is 1 or A002828(2+n) is 2 or A002828(3+n) is 3 or A002828(4+n) is 4, as the maximum value that A002828 may obtain is 4.

Indexing starts from zero, because a(0)=0 is a special case in this sequence.

Links

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

Prog

(Scheme, with Antti Karttunen's IntSeq-library)
(define A278489 (NONZERO-POS 0 0 A278216))

Crossrefs

Complement: A278490.

Positions of nonzeros in A278216.

Cf. A276573 (the infinite trunk of the tree, is a subsequence).

Cf. A278491 (another subsequence).

Cf. A002828, A255131.

Sequence in context: A047401 A187952 A188028 * A191880 A084020 A167195

Adjacent sequences: A278486 A278487 A278488 * A278490 A278491 A278492

Keyword

nonn

Author

Antti Karttunen, Nov 25 2016

Status

approved