cp's OEIS Frontend

A097259 Numbers whose set of base 13 digits is {0,C}, where C base 13 = 12 base 10.

%I A097259 #15 Sep 08 2022 08:45:14
%S A097259 0,12,156,168,2028,2040,2184,2196,26364,26376,26520,26532,28392,28404,
%T A097259 28548,28560,342732,342744,342888,342900,344760,344772,344916,344928,
%U A097259 369096,369108,369252,369264,371124,371136,371280,371292,4455516
%N A097259 Numbers whose set of base 13 digits is {0,C}, where C base 13 = 12 base 10.
%C A097259 n such that there exists a permutation p_1, ..., p_n of 1, ..., n such that i + p_i is a power of 13 for every i.
%H A097259 Vincenzo Librandi, <a href="/A097259/b097259.txt">Table of n, a(n) for n = 0..1000</a>
%F A097259 a(n) = 12*A033049(n).
%F A097259 a(2n) = 13*a(n), a(2n+1) = a(2n)+12.
%t A097259 f[n_] := FromDigits[ IntegerDigits[n, 2] /. {1 -> 12}, 13]; Array[f, 33, 0] (* or much slower *)
%t A097259 fQ[n_] := Union@ Join[{0, 12}, IntegerDigits[n, 13]] == {0, 12}; Select[ Range[0, 4455516 ], fQ] (* _Robert G. Wilson v_, May 12 2012 *)
%t A097259 FromDigits[#,13]&/@Tuples[{0,12},5] (* _Vincenzo Librandi_, Jun 04 2012 *)
%o A097259 (Magma) [n: n in [0..4500000] | Set(IntegerToSequence(n, 13)) subset {0, 12}]; // _Vincenzo Librandi_, Jun 04 2012
%Y A097259 Cf. A001196, A005823, A097251-A097262.
%K A097259 nonn,base
%O A097259 0,2
%A A097259 _Ray Chandler_, Aug 03 2004