cp's OEIS Frontend

A135293 Differences between successive numbers whose sum of digits in base 3 is 2.

%I A135293 #14 Jul 04 2019 11:52:10
%S A135293 2,2,2,4,2,6,10,2,6,18,28,2,6,18,54,82,2,6,18,54,162,244,2,6,18,54,
%T A135293 162,486,730,2,6,18,54,162,486,1458,2188,2,6,18,54,162,486,1458,4374,
%U A135293 6562,2,6,18,54,162,486,1458,4374,13122
%N A135293 Differences between successive numbers whose sum of digits in base 3 is 2.
%C A135293 First differences of A052216 when the entries in that sequence are interpreted as base 3 numbers.
%C A135293 Can be regarded as a triangle, where T(0,0)=2, T(n+1,0) = T(n,0)+T(n,n), T(n+1,m) = T(n,m) for 0 < m <= n and T(n+1,n+1) = sum of T(n+1,0..n)
%H A135293 G. C. Greubel, <a href="/A135293/b135293.txt">Table of n, a(n) for the first 50 rows</a>
%F A135293 T(n,m) = 2*3^(m-1) = A025192(m) for m>0. T(n,0) = 2*A124302(n). - _Franklin T. Adams-Watters_, Sep 29 2011
%e A135293 triangle begins:
%e A135293 2
%e A135293 2 2
%e A135293 4 2 6
%e A135293 10 2 6 18
%e A135293 28 2 6 18 54
%e A135293 82 2 6 18 54 162
%e A135293 244 2 6 18 54 162 486.
%t A135293 T[0, 0] := 2; T[n_, 0] := 3^(n - 1) + 1; T[n_, m_] := 2*3^(m - 1); Table[T[n, m], {n, 0, 5}, {m, 0, n}] (* _G. C. Greubel_, Oct 09 2016 *)
%t A135293 Join[{2},Differences[Select[Range[50000],Total[IntegerDigits[#,3]]==2&]]] (* _Harvey P. Dale_, Jul 04 2019 *)
%Y A135293 Cf. A052216.
%K A135293 nonn,tabl,base
%O A135293 0,1
%A A135293 Adam Shelly (adam.shelly(AT)gmail.com), Dec 04 2007, Dec 05 2007
%E A135293 Edited by _Franklin T. Adams-Watters_, Sep 29 2011