A001845 Centered octahedral numbers (crystal ball sequence for cubic lattice). (Formerly M4384 N1844)

1, 7, 25, 63, 129, 231, 377, 575, 833, 1159, 1561, 2047, 2625, 3303, 4089, 4991, 6017, 7175, 8473, 9919, 11521, 13287, 15225, 17343, 19649, 22151, 24857, 27775, 30913, 34279, 37881, 41727, 45825, 50183, 54809, 59711, 64897, 70375, 76153, 82239

Offset

0,2

Comments

Number of points in simple cubic lattice at most n steps from origin.

If X is an n-set and Y_i (i=1,2,3) mutually disjoint 2-subsets of X then a(n-6) is equal to the number of 6-subsets of X intersecting each Y_i (i=1,2,3). - Milan Janjic, Aug 26 2007

Equals binomial transform of [1, 6, 12, 8, 0, 0, 0, ...] where (1, 6, 12, 8) = row 3 of the Chebyshev triangle A013609. - Gary W. Adamson, Jul 19 2008

Let A be the Hessenberg matrix of order n, defined by: A[1,j]=1, A[i,i]:=2,(i>1), A[i,i-1]=-1, and A[i,j]=0 otherwise. Then, for n >= 4, a(n-2) = -coeff(charpoly(A,x),x^(n-3)). - Milan Janjic, Jan 26 2010

a(n) = A005408(n) * A097080(n-1) / 3. - Reinhard Zumkeller, Dec 15 2013

a(n) = D(3,n) where D are the Delannoy numbers (A008288). As such, a(n) gives the number of grid paths from (0,0) to (3,n) using steps that move one unit north, east, or northeast. - David Eppstein, Sep 07 2014

The first comment above can be re-expressed and generalized as follows: a(n) is the number of points in Z^3 that are L1 (Manhattan) distance <= n from any given point. Equivalently, due to a symmetry that is easier to see in the Delannoy numbers array (A008288), as a special case of Dmitry Zaitsev's Dec 10 2015 comment on A008288, a(n) is the number of points in Z^n that are L1 (Manhattan) distance <= 3 from any given point. - Shel Kaphan, Jan 02 2023

References

L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 81.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

T. D. Noe, Table of n, a(n) for n = 0..1000

Luciano Ancora, The Square Pyramidal Number and other figurate numbers, ch. 4.

Bela Bajnok, Additive Combinatorics: A Menu of Research Problems, arXiv:1705.07444 [math.NT], May 2017. See Section 2.3.

D. Bump, K. Choi, P. Kurlberg, and J. Vaaler, A local Riemann hypothesis, I pages 16 and 17

J. H. Conway and N. J. A. Sloane, Low-Dimensional Lattices VII: Coordination Sequences, Proc. Royal Soc. London, A453 (1997), 2369-2389 (pdf).

Milan Janjic, Two Enumerative Functions

Milan Janjic, Hessenberg Matrices and Integer Sequences , J. Int. Seq. 13 (2010) # 10.7.8.

Milan Janjić, On Restricted Ternary Words and Insets, arXiv:1905.04465 [math.CO], 2019.

G. Kreweras, Sur les hiérarchies de segments, Cahiers Bureau Universitaire Recherche Opérationnelle, Cahier 20, Inst. Statistiques, Univ. Paris, 1973.

G. Kreweras, Sur les hiérarchies de segments, Cahiers du Bureau Universitaire de Recherche Opérationnelle, Institut de Statistique, Université de Paris, #20 (1973). (Annotated scanned copy)

T. P. Martin, Shells of atoms, Phys. Reports, 273 (1996), 199-241, eq. (10).

Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.

Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992

R. G. Stanton and D. D. Cowan, Note on a "square" functional equation, SIAM Rev., 12 (1970), 277-279.

Eric Weisstein's World of Mathematics, Haüy Construction

Eric Weisstein's World of Mathematics, Octahedral Number

Index entries for crystal ball sequences

Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1).

Formula

G.f.: (1+x)^3 /(1-x)^4. [conjectured (correctly) by Simon Plouffe in his 1992 dissertation]

a(n) = (2*n+1)*(2*n^2 + 2*n + 3)/3.

First differences of A014820(n). - Alexander Adamchuk, May 23 2006

a(n) = a(n-1) + 4*n^2 + 2, a(0)=1. - Vincenzo Librandi, Mar 27 2011

a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4), with a(0)=1, a(1)=7, a(2)=25, a(3)=63. - Harvey P. Dale, Jun 05 2013

a(n) = Sum_{k=0..min(3,n)} 2^k * binomial(3,k) * binomial(n,k). See Bump et al. - Tom Copeland, Sep 05 2014

From Luciano Ancora, Jan 08 2015: (Start)

a(n) = 2 * A000330(n) + A000330(n+1) + A000330(n-1).

a(n) = A005900(n) + A005900(n+1).

a(n) = A005900(n) + A000330(n) + A000330(n+1).

a(n) = A000330(n-1) + A000330(n) + A005900(n+1). (End)

a(n) = A002412(n+1) + A016061(n-1) for n > 0. - Bruce J. Nicholson, Nov 12 2017

E.g.f.: exp(x)*(3 + 18*x + 18*x^2 + 4*x^3)/3. - Stefano Spezia, Mar 14 2024

Sum_{n >= 1} (-1)^(n+1)/(n*a(n-1)*a(n)) = 5/6 - log(2) = (1 - 1/2 + 1/3) - log(2). - Peter Bala, Mar 21 2024

Mathematica

Table[(4 n^3 - 6 n^2 + 8 n - 3)/3, {n, 100}] (* Vladimir Joseph Stephan Orlovsky, Jan 15 2011 *)
LinearRecurrence[{4, -6, 4, -1}, {1, 7, 25, 63}, 40] (* Harvey P. Dale, Jun 05 2013 *)
CoefficientList[Series[(1 + x)^3/(-1 + x)^4, {x, 0, 20}], x] (* Eric W. Weisstein, Sep 27 2017 *)

Prog

(PARI) a(n)=(2*n+1)*(2*n^2+2*n+3)/3 \\ Charles R Greathouse IV, Dec 06 2011
(Haskell)
a001845 n = (2 * n + 1) * (2 * n ^ 2 + 2 * n + 3) `div` 3
-- Reinhard Zumkeller, Dec 15 2013

Crossrefs

Sums of 2 consecutive terms give A008412.

(1/12)*t*(2*n^3 - 3*n^2 + n) + 2*n - 1 for t = 2, 4, 6, ... gives A049480, A005894, A063488, A001845, A063489, A005898, A063490, A057813, A063491, A005902, A063492, A005917, A063493, A063494, A063495, A063496.

Partial sums of A005899.

Cf. A001846, A001847, A001848, etc., A014820, A013609.

Cf. also A240876, A002412, A016061, A005899.

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.

Row/column 3 of A008288.

Sequence in context: A362348 A185787 A299273 * A127765 A155305 A155290

Adjacent sequences: A001842 A001843 A001844 * A001846 A001847 A001848

Keyword

nonn,easy,nice

Author

N. J. A. Sloane

Status

approved