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 A210592 #50 Jan 31 2025 17:20:25 %S A210592 1,1,2,4,10,23,63,155,448,1152,3452,9158,28178,76539,240370,665129, %T A210592 2123439,5964691,19302316,54898417,179696558,516468943,1707136794, %U A210592 4950706511,16503342067,48232628420,161984027241,476636439213,1611286734027,4769639146736,16218693724179 %N A210592 Meandric numbers for a river crossing up to 19 parallel roads at n points. %C A210592 Number of ways that a river (or directed line) that starts in the South and flows East can cross up to 19 parallel East-West roads n times. %C A210592 Sequence derived from list of solutions described in A206432. %H A210592 Andrew Howroyd, <a href="/A210592/b210592.txt">Table of n, a(n) for n = 0..40</a> %Y A210592 Column k=19 of A380367. %Y A210592 Cf. A005316 (sequence for one road; extensive references and links). %Y A210592 Cf. A076876 (sequence for two parallel roads). %Y A210592 Cf. A204352, A208062, A208126, A208452, A208453, A209383, A209621, A209622, A209626, A209656, A209657, A209660, A209707, A210344, A210478, A210567, A210592 (sequences for 3 to 19 parallel roads). %Y A210592 Cf. A206432 (sequence for unlimited number of parallel roads). %Y A210592 Cf. A076875, A076906, A076907. %K A210592 nonn %O A210592 0,3 %A A210592 _Robert Price_, May 07 2012 %E A210592 a(21) onwards from _Andrew Howroyd_, Jan 31 2025