The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A005398 Number of n-step polygons on f.c.c. lattice. (Formerly M4512) 2
 8, 33, 168, 970, 6168, 42069, 301376, 2241420, 17173224, 134806948, 1079802216, 8798329080, 72748583832, 609220407150, 5158999447488 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,1 REFERENCES A. J. Guttman, Polygons, Polyominoes and Polycubes, Lecture Notes in Physics Volume 775, 2009, Chapter 16. N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). LINKS M. F. Sykes et al., Lattice constant systems and graph theory, J. Math. Phys., 7 (1966), 1557-1572. MATHEMATICA A001337 = Cases[Import["https://oeis.org/A001337/b001337.txt", "Table"], {_, _}][[All, 2]]; a[n_] := A001337[[n]]/(2n); a /@ Range[3, 17] (* Jean-François Alcover, Jan 20 2020 *) CROSSREFS Equals A001337(n) / (2n). Sequence in context: A297683 A220590 A001407 * A240044 A069509 A204191 Adjacent sequences:  A005395 A005396 A005397 * A005399 A005400 A005401 KEYWORD nonn,more,nice AUTHOR EXTENSIONS More terms from Ruperto Corso, Dec 19 2011 a(15) and a(16) from Sean A. Irvine, Mar 30 2017 a(17) from Bert Dobbelaere, Jan 14 2019 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 December 2 14:26 EST 2020. Contains 338877 sequences. (Running on oeis4.)