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 A169877 #10 Aug 17 2023 20:44:40 %S A169877 7,16,38,100,275,784,2280,6724,19964,59536,177989,532900,1596849, %T A169877 4787344,14356482,43059844,129162891,387459856,1162329651,3486902500, %U A169877 10460557755,31381413904,94143792483,282430599364,847290450408,2541869016976,7625603007884,22876802020900,68630393933574 %N A169877 Maximum number of rational points on a smooth absolutely irreducible projective curve of genus 1 over the field F_3^n. %H A169877 Robin Visser, <a href="/A169877/b169877.txt">Table of n, a(n) for n = 1..2000</a> %H A169877 Max Deuring, <a href="https://doi.org/10.1007/BF02940746">Die Typen der Multiplikatorenringe elliptischer Funktionenkörper</a>, Abh. Math. Sem. Hansischen Univ. 14 (1941), 197-272. %H A169877 Gerard van der Geer et al., <a href="http://www.manypoints.org">Tables of curves with many points</a> %H A169877 Gerard van der Geer and Marcel van der Vlugt, <a href="https://doi.org/10.1090/S0025-5718-99-01143-6">Tables of curves with many points</a>, Math. Comp. 69 (2000) 797-810. %H A169877 W. C. Waterhouse, <a href="https://doi.org/10.24033/asens.1183">Abelian varieties over finite fields</a>, Ann Sci. E.N.S., (4) 2 (1969), 521-560. %F A169877 a(n) = 3^n + 1 + floor(2*3^(n/2)) if 3 does not divide floor(2*3^(n/2)), n is even, or n = 1. Otherwise a(n) = 3^n + floor(2*3^(n/2)) [Deuring-Waterhouse]. - _Robin Visser_, Aug 17 2023 %o A169877 (Sage) %o A169877 def a(n): %o A169877 if (n==1) or (n%2 == 0) or (floor(2*3^(n/2))%3 != 0): %o A169877 return 3^n + 1 + floor(2*3^(n/2)) %o A169877 else: %o A169877 return 3^n + floor(2*3^(n/2)) # _Robin Visser_, Aug 17 2023 %Y A169877 Cf. A005523, A169869-A169883. %K A169877 nonn %O A169877 1,1 %A A169877 _N. J. A. Sloane_, Jul 05 2010 %E A169877 More terms from _Robin Visser_, Aug 17 2023