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 A212870 #6 Apr 09 2023 23:02:42 %S A212870 0,0,1,3,9,16,29,43,64,92,127,168,219,281,355,435,531,638,762,901, %T A212870 1057,1230,1420,1628,1858,2107,2380,2674,2992,3338,3707,4099,4524, %U A212870 4976,5465,5975,6516,7092,7704,8348,9025,9744,10495,11289,12125,12994,13907,14859 %N A212870 Number of nondecreasing sequences of 3 1..n integers with no element dividing the sequence sum. %C A212870 Row 3 of A212868. %H A212870 R. H. Hardin, <a href="/A212870/b212870.txt">Table of n, a(n) for n = 1..210</a> %e A212870 Some solutions for n=8 %e A212870 ..3....5....3....2....6....2....6....7....3....3....2....4....3....6....3....5 %e A212870 ..7....7....5....5....7....2....6....8....5....3....3....7....4....6....3....8 %e A212870 ..7....7....5....6....7....7....8....8....6....4....8....7....4....7....8....8 %Y A212870 Cf. A212868. %K A212870 nonn %O A212870 1,4 %A A212870 _R. H. Hardin_, May 29 2012