|
%I #21 Sep 08 2022 08:45:29
%S 47,61,75,89,103,117,131,145,159,173,187,201,215,229,243,257,271,285,
%T 299,313,327,341,355,369,383,397,411,425,439,453,467,481,495,509,523,
%U 537,551,565,579,593,607,621,635,649,663,677,691,705,719,733,747
%N a(n) = 14*n + 47.
%C Superhighway created by 'LQTL Ant' L90R135L90R135 from iteration 47 where the Ant moves in a 'Moore neighborhood' (nine cells), the L indicates a left turn, the R a right turn, and the numerical value is the turn angle (in degrees) at each iteration.
%D P. Sakar, "A Brief History of Cellular Automata," ACM Computing Surveys, vol. 32, 2000.
%D S. Wolfram, A New Kind of Science, 1st ed. Il.: Wolfram Media Inc., 2002.
%H Diana Mecum, <a href="/A126980/b126980.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F From _Chai Wah Wu_, May 30 2016: (Start)
%F a(n) = 2*a(n-1) - a(n-2) for n > 1.
%F G.f.: (-33*x + 47)/(x - 1)^2. (End)
%F E.g.f.: (47 + 14*x)*exp(x). - _G. C. Greubel_, May 30 2016
%t Table[14*n + 47, {n, 0, 60}] (* _Stefan Steinerberger_, Jun 17 2007 *)
%t LinearRecurrence[{2,-1}, {47,61}, 50] (* _G. C. Greubel_, May 30 2016 *)
%o (Magma) [14*n + 47: n in [0..60] ]; // _Vincenzo Librandi_, Jul 18 2011
%Y Cf. A017041, A019430, A094867, A126978, A126979.
%K easy,nonn
%O 0,1
%A _Robert H Barbour_, Mar 20 2007, Jun 12 2007
%E More terms from _Stefan Steinerberger_ and _Diana L. Mecum_, Jun 17 2007
|
