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 A304025 #29 Feb 12 2021 12:17:00
%S A304025 2,5,8,14,23,35,53,80,122,185,278,419,629,944,1418,2129,3194,4793,
%T A304025 7190,10787,16181,24272,36410,54617,81926,122891,184337,276506,414761,
%U A304025 622142,933215,1399823,2099735,3149603,4724405,7086608,10629914
%N A304025 a(n) is the largest integer that can be written with n digits in base 3/2.
%C A304025 A070885 is the smallest integer that can be written with n digits in base 3/2.
%C A304025 This sequence represented in base 3/2 is A304024.
%H A304025 B. Chen, R. Chen, J. Guo, S. Lee et al., <a href="http://arxiv.org/abs/1808.04304">On Base 3/2 and its Sequences</a>, arXiv:1808.04304 [math.NT], 2018.
%F A304025 a(n) = A070885(n+1) - 1.
%e A304025 The number 5 in base 3/2 is 22, and the number 6 is 210. Therefore, 5 is the largest integer needing two digits in base 3/2.
%o A304025 (PARI) first(n) = {my(res = vector(n)); res[1] = 2; for(i = 2, n, res[i] = 3 * res[i-1] / 2 + if(res[i-1] % 2==0, 2, 1/2));res} \\ _David A. Corneth_, May 11 2018
%Y A304025 Cf. A005428, A024629, A070885, A073941, A081848, A246435, A303500, A304024, A304272.
%K A304025 nonn,base,easy
%O A304025 1,1
%A A304025 _Tanya Khovanova_ and PRIMES STEP Senior group, May 04 2018