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.
%I A278490 #12 Nov 27 2016 22:06:29 %S A278490 1,2,4,5,7,10,12,13,14,17,20,22,23,25,26,28,29,31,33,34,36,37,42,44, %T A278490 46,47,49,52,55,57,58,60,61,62,65,68,69,76,77,79,82,84,86,89,92,94,97, %U A278490 98,100,101,103,106,109,110,113,116,118,119,121,122,124,125,127,132,133,140,141,142,145,148,150,153,154,156,157 %N A278490 Leaves in the tree defined by edge relation A255131(child) = parent, the least squares beanstalk. %C A278490 Numbers n for which there are no solutions to k - A002828(k) = n for any k, in other words, numbers n such that (A002828(1+n) <> 1) and (A002828(2+n) <> 2) and (A002828(3+n) <> 3) and (A002828(4+n) <> 4), as the maximum value that A002828 may obtain is 4. %H A278490 Antti Karttunen, <a href="/A278490/b278490.txt">Table of n, a(n) for n = 1..10000</a> %o A278490 (Scheme, with _Antti Karttunen_'s IntSeq-library) %o A278490 (define A278490 (ZERO-POS 1 1 A278216)) %Y A278490 Complement: A278489. %Y A278490 Positions of zeros in A278216. %Y A278490 Cf. A278494 (primes in this sequence). %K A278490 nonn %O A278490 1,2 %A A278490 _Antti Karttunen_, Nov 25 2016