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 A208062 #14 Dec 06 2015 11:44:58 %S A208062 1,1,2,4,10,22,61,142,420,1017,3146,7844,25083,63974,209875,545060, %T A208062 1824949,4810138,16374993,43695535,150820899,406669871,1420155120, %U A208062 3863613980,13627843933,37363313071,132933980698,366939582498,1315436809855,3652777067949,13182411646150 %N A208062 Meandric numbers for a river crossing up to 4 parallel roads at n points. %C A208062 Number of ways that a river (or directed line) that starts in the South and flows East can cross up to 4 parallel East-West roads n times. %C A208062 Sequence derived from list of solutions described in A206432. %H A208062 Andrew Howroyd, <a href="/A208062/b208062.txt">Table of n, a(n) for n = 0..36</a> %Y A208062 Cf. A005316 (sequence for one road; extensive references and links). %Y A208062 Cf. A076876 (sequence for two parallel roads). %Y A208062 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 A208062 Cf. A206432 (sequence for unlimited number of parallel roads). %Y A208062 Cf. A076875, A076906, A076907. %K A208062 nonn %O A208062 0,3 %A A208062 _Robert Price_, May 07 2012 %E A208062 a(21)-a(36) from _Andrew Howroyd_, Dec 05 2015