cp's OEIS Frontend

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.

A169781 a(n) = A169780(2^n).

Original entry on oeis.org

1, 3, 9, 29, 99, 361, 1373, 5349, 21109, 83859, 334275, 1334769, 5334413, 21328351, 85294869
Offset: 0

Views

Author

N. J. A. Sloane, May 11 2010

Keywords

Comments

These are the "high water marks" in A169780.

Crossrefs

Programs

  • Mathematica
    initTriangle[ ] := {{1, 0, 1, 0, 1}, {1, 0, 1, 1, 0, 1}, {1, 0, 1, 0, 1, 0, 1}, {1, 0, 1, 1, 1, 1, 0, 1}, {1, 0, 1, 0, 0, 0, 1, 0, 1}, {1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1}};
    nextRow[k_] := Join[{1, 0}, Table[0, k], {0, 1}]
    neighborPosList[{i_, j_}] := {{i - 1, j - 1}, {i - 1, j}, {i, j - 1}, {i, j + 1}, {i + 1, j}, {i + 1, j + 1}}
    neighborEmptyList[{i_, j_}] := Select[neighborPosList[{i, j}], nTriangle[[Apply[Sequence, #]]] == 0 &]
    getCellValue[{i_, j_}] := nTriangle[[i, j]]
    a169781[n_] := Module[{newGen = { }, lastGen = {{5, 3}, {5, 7}}, newCount = 0, totalCount = 11, k, p, emptyNs, q, emptyCs, r}, nTriangle = initTriangle[ ]; For[k = 6, k <= n, k++, AppendTo[nTriangle, nextRow[k + 1]]; For[p = 1, p <= Length[lastGen], p++, emptyNs = Select[neighborPosList[lastGen[[p]]], getCellValue[#] == 0 &]; For[q = 1, q <= Length[emptyNs], q++, emptyCs = Select[neighborPosList[emptyNs[[q]]], getCellValue[#] == 1 &]; If[Length[emptyCs] == 1, AppendTo[newGen, emptyNs[[q]]]]]]; For[r = 1, r <= Length[newGen], r++, nTriangle[[Apply[Sequence, newGen[[r]]]]] = 1]; lastGen = newGen; totalCount += Length[newGen]; newGen = { }]; totalCount]/;(n>=2^3 && IntegerQ[Log[2, n]])
    a169781[2^11] (* sample invocation for a(11) - Hartmut F. W. Hoft, Apr 17 2020 *)

Extensions

a(11)-a(14) from Hartmut F. W. Hoft, Apr 17 2020