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 A097261 #16 Sep 08 2022 08:45:14
%S A097261 0,14,210,224,3150,3164,3360,3374,47250,47264,47460,47474,50400,50414,
%T A097261 50610,50624,708750,708764,708960,708974,711900,711914,712110,712124,
%U A097261 756000,756014,756210,756224,759150,759164,759360,759374,10631250
%N A097261 Numbers whose set of base 15 digits is {0,E}, where E base 15 = 14 base 10.
%C A097261 n such that there exists a permutation p_1, ..., p_n of 1, ..., n such that i + p_i is a power of 15 for every i.
%H A097261 Vincenzo Librandi, <a href="/A097261/b097261.txt">Table of n, a(n) for n = 0..1000</a>
%F A097261 a(n) = 14*A033051(n).
%F A097261 a(2n) = 15*a(n), a(2n+1) = a(2n)+14.
%t A097261 f[n_] := FromDigits[ IntegerDigits[n, 2] /. {1 -> 14}, 15]; Array[f, 33, 0] (* or *)
%t A097261 FromDigits[#, 15] & /@ Tuples[{0, 14}, 6] (* _Harvey P. Dale_, Sep 22 2011 *) (* or much slower *)
%t A097261 fQ[n_] := Union@ Join[{0, 14}, IntegerDigits[n, 15]] == {0, 14}; Select[ Range[0, 10634414 ], fQ] (* _Robert G. Wilson v_, May 12 2012 *)
%o A097261 (Magma) [n: n in [0..4500000] | Set(IntegerToSequence(n, 15)) subset {0, 14}]; // _Vincenzo Librandi_, Jun 05 2012
%Y A097261 Cf. A001196, A005823, A097251-A097262.
%K A097261 nonn,base
%O A097261 0,2
%A A097261 _Ray Chandler_, Aug 03 2004