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 A246705 #10 Nov 18 2014 03:25:10 %S A246705 1,3,4,6,8,10,11,13,15,17,19,21,22,24,26,28,30,32,34,36,37,39,41,43, %T A246705 45,47,49,51,53,55,56,58,60,62,64,66,68,70,72,74,76,78,79,81,83,85,87, %U A246705 89,91,93,95,97,99,101,103,105,106,108,110,112,114,116,118 %N A246705 Position of first n in A246694 (read as sequence with offset changed to 1); complement of A246706. %e A246705 A246694 begins with 1, 1, 2, 3, 2, 4, 3, 5, 4, 6, 7, 5, 8, 6, 9, 7, so that, for a(n) = position of first n and b(n) = position of last n, we have a = (1,3,4,6,8,10,...) and b = (2,5,7,9,12,...). %e A246705 Note, however, that A246694 has offset 0, so the values here are off by 1 from the positions as given by the indices (b-file or list) in that sequence. - _M. F. Hasler_, Nov 17 2014 %t A246705 z = 25; t[0, 0] = 1; t[1, 0] = 1; t[1, 1] = 2; %t A246705 t[n_, 0] := If[OddQ[n], t[n - 1, n - 2] + 1, t[n - 1, n - 1] + 1]; %t A246705 t[n_, 1] := If[OddQ[n], t[n - 1, n - 1] + 1, t[n - 1, n - 2] + 1]; %t A246705 t[n_, k_] := t[n, k - 2] + 1; %t A246705 u = Flatten[Table[t[n, k], {n, 0, z}, {k, 0, n}]]; (*A246694*) %t A246705 w[n_] := Flatten[Position[u, n]]; A246705 = Table[First[w[n]], {n, 1, 3*z}] %Y A246705 Cf. A246694, A246695, A246706. %K A246705 nonn,easy %O A246705 1,2 %A A246705 _Clark Kimberling_, Sep 02 2014