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 A262678 #6 Oct 04 2015 13:08:00 %S A262678 0,0,1,2,0,1,2,3,4,0,1,2,8,4,5,6,0,1,9,10,4,5,13,14,8,0,1,2,3,4,5,6, %T A262678 16,8,9,10,0,1,2,3,4,16,17,18,8,9,10,11,32,0,1,2,16,4,5,6,20,8,9,10, %U A262678 11,25,13,14,0,1,2,18,4,5,34,22,36,9,25,26,40,13,29,30,16,0,1,2,20,4,5,6,52,25,9,10,11,29,13,14,32,16,49,18,0 %N A262678 a(n) = n - A262690(n), where A262690(n) = largest square k <= n such that A002828(n-k) = A002828(n)-1. %H A262678 Antti Karttunen, <a href="/A262678/b262678.txt">Table of n, a(n) for n = 0..65536</a> %F A262678 a(n) = n - A262690(n). %o A262678 (Scheme) (define (A262678 n) (- n (A262690 n))) %Y A262678 Cf. A002828, A262689, A262690. %Y A262678 Cf. also A053186. %K A262678 nonn %O A262678 0,4 %A A262678 _Antti Karttunen_, Oct 03 2015