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 A318632 #25 Sep 06 2018 19:23:38 %S A318632 1,2,2,4,3,5,5,9,8,11,12,17,16,21,24,34,34,43,47,61,65,82,92,116,124, %T A318632 147,166,200,220,262,293,350,383,449,504,592,654,756,846,983,1089, %U A318632 1252,1396,1607,1777,2033,2260,2590,2871,3261,3634,4116,4563,5145,5722,6454,7154,8032,8903,9989,11039 %N A318632 Let a partition of n be written in binary. Join any two binary ones which are adjacent horizontally or vertically. If all the binary ones are connected count this partition in a(n). %D A318632 George E. Andrews, The Theory of Partitions, Addison-Wesley, Reading, Mass., 1976. %D A318632 G. E. Andrews and K. Ericksson, Integer Partitions, Cambridge University Press 2004. %e A318632 The partition of 7 = 3 + 2 + 2 looks like this in binary: %e A318632 11 %e A318632 10 %e A318632 10 %e A318632 The binary ones are adjacent so this partition is counted in a(7). %e A318632 The partition 7 = 5 + 2 looks like this in binary: %e A318632 101 %e A318632 10 %e A318632 Since the binary ones are not adjacent horizontally or vertically this partition is not counted in a(7). %K A318632 nonn %O A318632 1,2 %A A318632 _David S. Newman_, Aug 30 2018 %E A318632 a(9)-a(61) from _Robert Price_, Sep 06 2018