%I #11 Nov 27 2016 22:06:24
%S 0,3,6,8,9,11,15,16,18,19,21,24,27,30,32,35,38,39,40,41,43,45,48,50,
%T 51,53,54,56,59,63,64,66,67,70,71,72,73,74,75,78,80,81,83,85,87,88,90,
%U 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
%N Nonleaves in the tree defined by edge relation A255131(child) = parent, the least squares beanstalk.
%C 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.
%C Indexing starts from zero, because a(0)=0 is a special case in this sequence.
%H Antti Karttunen, <a href="/A278489/b278489.txt">Table of n, a(n) for n = 0..10000</a>
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A278489 (NONZERO-POS 0 0 A278216))
%Y Complement: A278490.
%Y Positions of nonzeros in A278216.
%Y Cf. A276573 (the infinite trunk of the tree, is a subsequence).
%Y Cf. A278491 (another subsequence).
%Y Cf. A002828, A255131.
%K nonn
%O 0,2
%A _Antti Karttunen_, Nov 25 2016
|