A126980 a(n) = 14*n + 47.

47, 61, 75, 89, 103, 117, 131, 145, 159, 173, 187, 201, 215, 229, 243, 257, 271, 285, 299, 313, 327, 341, 355, 369, 383, 397, 411, 425, 439, 453, 467, 481, 495, 509, 523, 537, 551, 565, 579, 593, 607, 621, 635, 649, 663, 677, 691, 705, 719, 733, 747

Offset: 0

Author

Robert H Barbour, Mar 20 2007, Jun 12 2007

Keywords

• easy
• nonn

Comments

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.

References

• P. Sakar, "A Brief History of Cellular Automata," ACM Computing Surveys, vol. 32, 2000.
• S. Wolfram, A New Kind of Science, 1st ed. Il.: Wolfram Media Inc., 2002.

Links

• Diana Mecum, Table of n, a(n) for n = 0..1000
• Index entries for linear recurrences with constant coefficients, signature (2,-1).

Crossrefs

Cf. A017041, A019430, A094867, A126978, A126979.

Programs

Magma

[14*n + 47: n in [0..60] ]; // Vincenzo Librandi, Jul 18 2011

Mathematica

Table[14*n + 47, {n, 0, 60}] (* Stefan Steinerberger, Jun 17 2007 *)
LinearRecurrence[{2,-1}, {47,61}, 50] (* G. C. Greubel, May 30 2016 *)

Formula

From Chai Wah Wu, May 30 2016: (Start)

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

G.f.: (-33*x + 47)/(x - 1)^2. (End)

E.g.f.: (47 + 14*x)*exp(x). - G. C. Greubel, May 30 2016

Extensions

More terms from Stefan Steinerberger and Diana L. Mecum, Jun 17 2007