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!)
 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 Charles R Greathouse IV, Table of n, a(n) for n = 1..10000 R. G. Wilson, V, Letter to N. J. A. Sloane, Aug. 1992 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 Cf. A060031. Sequence in context: A080285 A138628 A050868 * A175436 A074939 A038464 Adjacent sequences:  A007316 A007317 A007318 * A007320 A007321 A007322 KEYWORD nonn,easy AUTHOR EXTENSIONS Corrected and extended by Larry Reeves (larryr(AT)acm.org), Apr 20 2001 STATUS approved

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 18 02:38 EDT 2021. Contains 343072 sequences. (Running on oeis4.)