cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A005901 Number of points on surface of cuboctahedron (or icosahedron): a(0) = 1; for n > 0, a(n) = 10n^2 + 2. Also coordination sequence for f.c.c. or A_3 or D_3 lattice.

Original entry on oeis.org

1, 12, 42, 92, 162, 252, 362, 492, 642, 812, 1002, 1212, 1442, 1692, 1962, 2252, 2562, 2892, 3242, 3612, 4002, 4412, 4842, 5292, 5762, 6252, 6762, 7292, 7842, 8412, 9002, 9612, 10242, 10892, 11562, 12252, 12962, 13692, 14442, 15212, 16002
Offset: 0

Views

Author

N. J. A. Sloane, R. Vaughan

Keywords

Comments

Sequence found by reading the segment (1, 12) together with the line from 12, in the direction 12, 42, ..., in the square spiral whose vertices are the generalized heptagonal numbers A085787. - Omar E. Pol, Jul 18 2012

References

  • H. S. M. Coxeter, "Polyhedral numbers," in R. S. Cohen et al., editors, For Dirk Struik. Reidel, Dordrecht, 1974, pp. 25-35.
  • Gmelin Handbook of Inorg. and Organomet. Chem., 8th Ed., 1994, TYPIX search code (225) cF4
  • B. Grünbaum, Uniform tilings of 3-space, Geombinatorics, 4 (1994), 49-56. See tiling #1.
  • R. W. Marks and R. B. Fuller, The Dymaxion World of Buckminster Fuller. Anchor, NY, 1973, p. 46.
  • S. Rosen, Wizard of the Dome: R. Buckminster Fuller; Designer for the Future. Little, Brown, Boston, 1969, p. 109.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Partial sums give A005902.
The 28 uniform 3D tilings: cab: A299266, A299267; crs: A299268, A299269; fcu: A005901, A005902; fee: A299259, A299265; flu-e: A299272, A299273; fst: A299258, A299264; hal: A299274, A299275; hcp: A007899, A007202; hex: A005897, A005898; kag: A299256, A299262; lta: A008137, A299276; pcu: A005899, A001845; pcu-i: A299277, A299278; reo: A299279, A299280; reo-e: A299281, A299282; rho: A008137, A299276; sod: A005893, A005894; sve: A299255, A299261; svh: A299283, A299284; svj: A299254, A299260; svk: A010001, A063489; tca: A299285, A299286; tcd: A299287, A299288; tfs: A005899, A001845; tsi: A299289, A299290; ttw: A299257, A299263; ubt: A299291, A299292; bnn: A007899, A007202. See the Proserpio link in A299266 for overview.

Programs

  • Magma
    [n eq 0 select 1 else 2*(5*n^2+1): n in [0..55]]; // G. C. Greubel, May 25 2023
    
  • Mathematica
    Join[{1},10*Range[40]^2+2] (* or *) Join[{1},LinearRecurrence[{3,-3,1},{12,42,92},40]] (* Harvey P. Dale, May 28 2014 *)
  • PARI
    a(n)=if(n<0,0,10*n^2+1+(n>0))
    
  • SageMath
    [2*(5*n^2 + 1)-int(n==0) for n in range(56)] # G. C. Greubel, May 25 2023

Formula

G.f.: (1+x)*(1+8*x+x^2)/(1-x)^3. - Simon Plouffe in his 1992 dissertation
G.f. for coordination sequence for A_n lattice is (1-z)^(-n) * Sum_{i=0..n} binomial(n, i)^2*z^i. [Bacher et al.]
a(n+1) = A027599(n+2) + A092277(n+1) - Creighton Dement, Feb 11 2005
a(n) = 2 + A033583(n), n >= 1. - Omar E. Pol, Jul 18 2012
a(n) = 12 + 24*(n-1) + 8*A000217(n-2) + 6*A000290(n-1). The properties of the cuboctahedron, namely, its number of vertices (12), edges (24), and faces as well as face-type (8 triangles and 6 squares), are involved in this formula. - Peter M. Chema, Mar 26 2017
a(n) = A062786(n) + A062786(n+1). - R. J. Mathar, Feb 28 2018
E.g.f.: -1 + 2*(1 + 5*x + 5*x^2)*exp(x). - G. C. Greubel, May 25 2023
Sum{n>=0} 1/a(n) = 3/4 + Pi*sqrt(5)*coth(Pi/sqrt 5)/20 = 1.14624... - R. J. Mathar, Apr 27 2024

A257144 Numbers n not of the form x+y*x^2 for x>1 and y>0.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 8, 9, 11, 13, 15, 16, 17, 19, 23, 24, 25, 27, 28, 29, 31, 32, 33, 35, 37, 40, 41, 43, 44, 45, 47, 49, 51, 53, 59, 60, 61, 63, 64, 65, 67, 69, 71, 73, 76, 77, 79, 81, 83, 85, 87, 88, 89, 91, 92, 95, 96, 97, 99, 101, 103, 104, 107, 108, 109, 112, 113, 115, 117, 119, 121
Offset: 1

Views

Author

Gionata Neri, Apr 16 2015

Keywords

Comments

Number n such that (d*k+1) /= (n/d), for k>0 and each value of d, where d is a divisor >1 of n.

Crossrefs

For numbers of the form x+y*x^2 with 0A002378 (y=1), A014105 (y=2), A049451 (y=3), A007742 (y=4), A202803 (y=5), A049453 (y=6), A092277 (y=7), A139275 (y=8), A154517 (y=9), A055437 (y=10). - Danny Rorabaugh, Apr 20 2015

Programs

  • Mathematica
    n = 71; Take[Complement[Range[n^2], DeleteDuplicates@ Sort@ Flatten@ Table[x + y x^2, {x, 2, n}, {y, 1, n}]], n] (* Michael De Vlieger, Apr 17 2015 *)
Showing 1-2 of 2 results.