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 A065562 #19 Sep 24 2017 02:31:20
%S A065562 1,2,4,3,6,8,5,9,11,13,7,12,15,17,19,10,16,20,22,24,26,14,21,25,28,30,
%T A065562 32,34,18,27,31,35,37,39,41,43,23,33,38,42,45,47,49,51,53,29,40,46,50,
%U A065562 54,56,58,60,62,64,36,48,55,59,63,66,68,70,72,74,76,44,57,65,69,73,77
%N A065562 a(n) = b(n)-th highest positive integer not equal to any a(k), 1 <= k < n, where {b(n)} = 1, 1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5, ... (sequence A002260).
%C A065562 Every positive integer occurs once and only once somewhere in this sequence.
%H A065562 Michael De Vlieger, <a href="/A065562/b065562.txt">Table of n, a(n) for n = 1..10000</a>
%H A065562 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%e A065562 b(6) = 3, so a(6) = 8 = 3rd-highest positive integer not equal to 1, 2, 4, 3, or 6 (the values of a(k), 1 <= k < 6).
%t A065562 Block[{a = {1}, s = Rest@ Range[96], r}, r = Flatten@ Map[Range, {1}~Join~Differences@ Most@ Reap[Do[If[Sow[PolygonalNumber@ i] > Last@ s, Break[]], {i, Infinity}]][[-1, 1]] ]; Do[AppendTo[a, s[[r[[i]] ]]]; s = Complement[s, a], {i, 2, 3 Max[s]/4}]; a] (* _Michael De Vlieger_, Sep 23 2017 *)
%Y A065562 Cf. A002260, A065579, A065561.
%K A065562 easy,nonn
%O A065562 1,2
%A A065562 _Leroy Quet_, Nov 29 2001