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.
for n in {1..4}; do geng -c -d1 $[2*$n] -q | multig -m$[2*$n] -r$[2*$n] -u; done
for ((n=0;n<30;n=n+2)); do geng -c -d1 7 -q | multig -r${n} -u; done
for ((n=0;n<11;n++)); do geng -c -d1 8 -q | multig -r${n} -u; done
for ((n=0;n<76;n=n+2)); do geng -c -d1 5 -q | multig -m${n} -u; done
There is no such thing as a graph with nodes of negative degree, and the "nodeless" graph has, according to the definition in the name, zero nodes of degree less than 0. So a(0) = 1.
for ((n=2; n<9; n++)); do
a=0
for ((d=0; d<${n}; d++)); do
s=$(geng -c -d1 ${n} -q | multig -r${d} -u 2>&1 | cut -d ' ' -f 7 | grep -v '^$')
a=$((a+s))
done
echo ${a}
done
# Andrey Zabolotskiy, Sep 26 2019
for ((n=0;n<12;n=n+2)); do geng -c -d1 9 -q | multig -r${n} -u; done
Comments