Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Apr 26 2021 14:22:14
%S 4,7,10,15,25,43,79,147,283,547,1075,2115,4195,8323,16579,33027,65923,
%T 131587,262915,525315,1050115,2099203,4197379,8392707,16783363,
%U 33562627,67121155,134234115,268460035,536903683,1073790979
%N Fold a square sheet of paper alternately vertically to the left and horizontally downwards; after each fold, draw a line along each inward crease; after n folds, the resulting graph has a(n) edges.
%C A342759 is the main sequence for this entry.
%H Rémy Sigrist, <a href="/A342761/a342761.png">Illustration of initial terms</a>
%H Rémy Sigrist, <a href="/A342761/a342761.txt">C# program for A342761</a>
%F Theorem: a(2*t) = 2^(2*t)+3*2^(t-1)+3 for t >= 1; a(2*t+1) = 2^(2*t+1)+2^(t+1)+3 for t >= 0. - _N. J. A. Sloane_, Apr 26 2021
%e See illustration in Links section.
%o (C#) See Links section.
%Y Cf. A342759.
%Y It appears that a(n) = A257418(n) + 2 for n >= 2. _Hugo Pfoertner_, Mar 29 2021 [This is true - _N. J. A. Sloane_, Apr 26 2021]
%K nonn
%O 0,1
%A _Rémy Sigrist_ and _N. J. A. Sloane_, Mar 22 2021