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 A202337 #22 Aug 09 2023 02:13:16 %S A202337 1,2,6,12,36,108,324,972,2916,8748,26244,78732,236196,708588,2125764, %T A202337 6377292,19131876,57395628,172186884,516560652,1549681956,4649045868, %U A202337 13947137604,41841412812,125524238436,376572715308,1129718145924,3389154437772,10167463313316 %N A202337 Range of A062723. %C A202337 Subsequence of A000792. %C A202337 Apparently a(n) = A052156(n - 1) for n >= 4. - _Georg Fischer_, Mar 26 2019 %H A202337 Reinhard Zumkeller, <a href="/A202337/b202337.txt">Table of n, a(n) for n = 1..1000</a> %H A202337 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (3). %F A202337 From _Colin Barker_, Mar 26 2019: (Start) %F A202337 G.f.: x*(1 - x - 6*x^3) / (1 - 3*x). %F A202337 a(n) = 4*3^(n-3) for n>3. %F A202337 a(n) = 3*a(n-1) for n>4. %F A202337 (End) %o A202337 (Haskell) %o A202337 a202337 n = a202337_list !! (n-1) %o A202337 a202337_list = f a062723_list where %o A202337 f (x:xs'@(x':xs)) = if x == x' then f xs' else x : f xs' %Y A202337 Cf. A000792, A003946, A027327, A025579, A052156, A062723. %K A202337 nonn %O A202337 1,2 %A A202337 _Reinhard Zumkeller_, Dec 17 2011