cp's OEIS Frontend

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.

A048338 a(n) in base 14 is a repdigit.

This page as a plain text file.
%I A048338 #23 Feb 16 2025 08:32:39
%S A048338 0,1,2,3,4,5,6,7,8,9,10,11,12,13,15,30,45,60,75,90,105,120,135,150,
%T A048338 165,180,195,211,422,633,844,1055,1266,1477,1688,1899,2110,2321,2532,
%U A048338 2743,2955,5910,8865,11820,14775,17730,20685,23640,26595,29550,32505,35460
%N A048338 a(n) in base 14 is a repdigit.
%H A048338 Vincenzo Librandi, <a href="/A048338/b048338.txt">Table of n, a(n) for n = 0..1300</a>
%H A048338 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Repdigit.html">Repdigit</a>
%F A048338 From _Chai Wah Wu_, May 30 2016: (Start)
%F A048338 a(n) = 15*a(n-13) - 14*a(n-26) for n > 25.
%F A048338 G.f.: x*(13*x^12 + 12*x^11 + 11*x^10 + 10*x^9 + 9*x^8 + 8*x^7 + 7*x^6 + 6*x^5 + 5*x^4 + 4*x^3 + 3*x^2 + 2*x + 1)/(14*x^26 - 15*x^13 + 1). (End)
%F A048338 a(n) = (n - 13*floor((n-1)/13))*(14^floor((n+12)/13) - 1)/13. - _Ilya Gutkovskiy_, May 30 2016
%t A048338 Union[Flatten[Table[FromDigits[PadRight[{}, n, d], 14], {n, 0, 50}, {d, 13}]]] (* _Vincenzo Librandi_, Feb 06 2014 *)
%o A048338 (Python)
%o A048338 A048338_list = [0] + [int(d*l,14) for l in range(1,10) for d in '123456789abcd'] # _Chai Wah Wu_, May 30 2016
%Y A048338 Cf. A010785, A033027, A028987, A028988.
%K A048338 nonn,base,easy
%O A048338 0,3
%A A048338 _Patrick De Geest_, Feb 15 1999