|
|
A007319
|
|
A grasshopper sequence: closed under n -> 2n+2 and 6n+6.
(Formerly M3373)
|
|
2
|
|
|
1, 4, 10, 12, 22, 26, 30, 46, 54, 62, 66, 78, 94, 110, 126, 134, 138, 158, 162, 186, 190, 222, 254, 270, 278, 282, 318, 326, 330, 374, 378, 382, 402, 446, 474, 510, 542, 558, 566, 570, 638, 654, 662, 666, 750, 758, 762, 766, 806, 810, 834, 894, 950, 954, 978
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
REFERENCES
|
C. Pickover, Computers and the Imagination, St. Martin's Press, NY, 1991, p. 353.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
MATHEMATICA
|
Take[ Sort[ Flatten[ NestList[{2#+2, 6#+6} &, 1, 8]]], 55] (* Wouter L.J. Meeussen Mar 06 2005 *)
|
|
PROG
|
(PARI) list(lim)=my(v=List([1]), x=1, X=4, y=1, Y=12, m); lim\=1; while((m=min(X, Y))<=lim, listput(v, m); if(m==X, X=v[x++]*2+2); if(m==Y, Y=v[y++]*6+6)); Vec(v) \\ Charles R Greathouse IV, Apr 15 2020
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Corrected and extended by Larry Reeves (larryr(AT)acm.org), Apr 20 2001
|
|
STATUS
|
approved
|
|
|
|