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 A355479 #18 Jan 05 2023 15:39:28
%S A355479 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,20,20,20,20,21,
%T A355479 22,23,24,24,25,26,27,28,29,30,31,31,31,31,31,32,33,34,35,36,37,38,39,
%U A355479 40,40,41,42,42,43,44,45,46,46,46,47,47,48,49,50,51,51,51
%N A355479 a(n) is the number of distinct honeycomb cell walls built after the n-th step of the walk described in A355478.
%C A355479 See A355478 for more information, animations, and illustration of selected terms.
%H A355479 Paolo Xausa, <a href="/A355479/b355479.txt">Table of n, a(n) for n = 0..9999</a>
%H A355479 <a href="/index/Wa#WALKS">Index entries for sequences related to walks</a>
%e A355479 In the following diagrams the walk is shown at the end of the n-th step, together with the position of the bee (*).
%e A355479 .
%e A355479 n 0 1 8 28 60
%e A355479 a(n) 0 1 8 24 47
%e A355479 __
%e A355479 __/ \*_
%e A355479 * __* __ __ / \__/ \__
%e A355479 \ \__ \__/ \__ \__
%e A355479 / / \__ \__/ \__/ \__
%e A355479 \ \*_ \__ \__/ \__ \__
%e A355479 / / \ \ / \ \
%e A355479 \ \__/ __/ \__/ __/
%e A355479 / / __/ / __/
%e A355479 \* \__/ \__/
%e A355479 .
%t A355479 A355479[nmax_]:=Module[{a={0},w={},p1={0, 0},p2,angle=0},Do[w=Union[w,{Sort[{p1,p2=AngleVector[p1,angle+=If[PrimeQ[n],-1,1]Pi/3]}]}];p1=p2;AppendTo[a,Length[w]],{n,nmax}];a];
%t A355479 A355479[100] (* _Paolo Xausa_, Jan 05 2023 *)
%Y A355479 Cf. A174313, A211020, A233399, A355478, A355480, A357434.
%K A355479 nonn,walk
%O A355479 0,3
%A A355479 _Paolo Xausa_, Jul 18 2022