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 A277023 #12 Oct 04 2016 13:30:49 %S A277023 0,3,6,11,16,27,38,51,64,83,102,123,144,171,198,227,256,291,326,361, %T A277023 400,444,486,531,576,627,678,731,786,843,902,963,1026,1091,1158,1227, %U A277023 1296,1371,1446,1523,1600,1683,1767,1851,1938,2025,2118,2211,2304,2403,2502,2603,2706,2811,2918,3027,3136,3251,3366,3483,3600,3723,3846 %N A277023 a(n) = A276573(A260732(n)); For n >= 1, a(n) = the next larger term right after each (n^2)-1 in the infinite trunk of least squares beanstalk. %H A277023 Antti Karttunen, <a href="/A277023/b277023.txt">Table of n, a(n) for n = 0..750</a> %F A277023 a(n) = A276573(A260732(n)). %o A277023 (Scheme) (define (A277023 n) (A276573 (A260732 n))) %Y A277023 Cf. A002828, A260732, A276573. %Y A277023 Cf. A277015 (the positions of squares in this sequence), A277024, A277025 A277026. %K A277023 nonn %O A277023 0,2 %A A277023 _Antti Karttunen_, Oct 03 2016