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.

A100093 a(n) = A100092(n^2+1).

This page as a plain text file.
%I A100093 #7 Aug 10 2021 11:04:35
%S A100093 1,1,1,6,11,35,73,182,374,816,1615,3244,6160,11678,21353,38742,68541,
%T A100093 120082,206448,351386,589237,978626,1605582,2610694,4201319,6705559,
%U A100093 10607058,16652362,25937765,40122446,61629301,94066442,142668403
%N A100093 a(n) = A100092(n^2+1).
%H A100093 S. Kurz, <a href="http://www.mathe2.uni-bayreuth.de/sascha/papers/extremal_polyominoes_paper1_2.pdf">Counting polyominoes with minimum perimeter</a>, submitted to Ars Combinatoria
%Y A100093 Cf. A100092, A100094.
%K A100093 nonn
%O A100093 0,4
%A A100093 _Sascha Kurz_, Nov 03 2004
%E A100093 a(0) prepended by _Jianing Song_, Aug 10 2021