The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A321237 Start with a square of dimension 1 X 1, and repeatedly append along the squares of the previous step squares with half their side length that do not overlap with any prior square; a(n) gives the number of squares appended at n-th step. 2

%I

%S 1,8,28,68,148,308,628,1268,2548,5108,10228,20468,40948,81908,163828,

%T 327668,655348,1310708,2621428,5242868,10485748,20971508,41943028,

%U 83886068,167772148,335544308,671088628,1342177268,2684354548,5368709108,10737418228,21474836468

%N Start with a square of dimension 1 X 1, and repeatedly append along the squares of the previous step squares with half their side length that do not overlap with any prior square; a(n) gives the number of squares appended at n-th step.

%C The following diagram depicts the first three steps of the construction:

%C +----+----+----+----+

%C | 3 | 3 | 3 | 3 |

%C +----+----+----+----+----+----+

%C | 3 | | | 3 |

%C +----+----+ 2 | 2 +----+----+

%C | 3 | 3 | | | 3 | 3 |

%C +----+----+----+---------+---------+----+----+----+

%C | 3 | | | | 3 |

%C +----+ 2 | | 2 +----+

%C | 3 | | | | 3 |

%C +----+---------+ 1 +---------+----+

%C | 3 | | | | 3 |

%C +----+ 2 | | 2 +----+

%C | 3 | | | | 3 |

%C +----+----+----+---------+---------+----+----+----+

%C | 3 | 3 | | | 3 | 3 |

%C +----+----+ 2 | 2 +----+----+

%C | 3 | | | 3 |

%C +----+----+----+----+----+----+

%C | 3 | 3 | 3 | 3 |

%C +----+----+----+----+

%C A square of step n+1 touches one or two squares of step n.

%C The limiting construction is an octagon (truncated square); its area is 7 times the area of the initial square.

%C See A321257 for a similar sequence.

%H Colin Barker, <a href="/A321237/b321237.txt">Table of n, a(n) for n = 1..1000</a>

%H Rémy Sigrist, <a href="/A321237/a321237.png">Illustration of the construction after 7 steps</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (3,-2).

%F a(n) = 4 * (2^(n-1) + 3 * (2^(n-2)-1)) for any n > 1.

%F a(n) = 4 * A154117(n-1) for any n > 1.

%F Sum_{n > 0} a(n) / 4^(n-1) = 7.

%F From _Colin Barker_, Nov 02 2018: (Start)

%F G.f.: x*(1 + 2*x)*(1 + 3*x) / ((1 - x)*(1 - 2*x)).

%F a(n) = 5*2^n - 12 for n>1.

%F a(n) = 3*a(n-1) - 2*a(n-2) for n>3.

%F (End)

%o (PARI) a(n) = if (n==1, return (1), return (4*( 2^(n-1) + 3 * floor( (2^(n-2)-1) ) )))

%o (PARI) Vec(x*(1 + 2*x)*(1 + 3*x) / ((1 - x)*(1 - 2*x)) + O(x^40)) \\ _Colin Barker_, Nov 02 2018

%Y Cf. A154117, A321257.

%K nonn,easy

%O 1,2

%A _Rémy Sigrist_, Nov 01 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 5 00:43 EDT 2020. Contains 333238 sequences. (Running on oeis4.)