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 A134468 #10 Sep 13 2015 20:39:56
%S A134468 0,17,28,34,40,51,57,68,80,84,85,91,97,103,107,108,114,120,125,130,
%T A134468 142,143,147,154,159,170,176,182,187,193,199,204,206,210,216,227,233,
%U A134468 244,250,256,260,261,267,273,278,283,284,296,301,307,318,319,323,324,330
%N A134468 Numbers n such that 2^n and 3^n have the same leading digit.
%p A134468 A000030 := proc(n) op(-1, convert(n,base,10)) ; end: isA134468 := proc(n) if A000030(2^n) = A000030(3^n) then true ; else false; fi ; end: for n from 0 to 800 do if isA134468(n) then printf("%d, ",n) ; fi ; od: # _R. J. Mathar_, Jan 30 2008
%t A134468 Select[Range[0, 500], IntegerDigits[2^# ][[1]] == IntegerDigits[3^# ][[1]] &] (* _Stefan Steinerberger_, Jan 21 2008 *)
%Y A134468 Cf. A008952, A060956.
%K A134468 nonn,base
%O A134468 1,2
%A A134468 _Lekraj Beedassy_, Jan 20 2008
%E A134468 More terms from _Stefan Steinerberger_, Jan 21 2008
%E A134468 More terms from _R. J. Mathar_, Jan 30 2008