login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054473 Number of ways of numbering the faces of a cube with nonnegative integers so that the sum of the 6 numbers is n. 0

%I #14 Sep 29 2013 05:21:52

%S 1,1,3,5,10,15,29,41,68,98,147,202,291,386,528,688,906,1151,1480,1841,

%T 2310,2833,3484,4207,5099,6076,7259,8562,10104,11796,13785,15948,

%U 18462,21201,24339,27747,31633,35827,40572,45695,51436,57618,64520,71918

%N Number of ways of numbering the faces of a cube with nonnegative integers so that the sum of the 6 numbers is n.

%C Here we consider the symmetries of the cube in 3D space (mirror reflections are not allowed), cf. A097513. - _Geoffrey Critzer_, Sep 28 2013

%F G.f.: (3*x^6+x^5+x^4+1)/((1-x^4)*(1-x^3)^2*(1-x^2)^2*(1-x)).

%t nn=43;f[x_]=1/(1-x);CoefficientList[Series[1/24 (f[x]^6+6f[x]^2f[x^4]+3f[x]^2f[x^2]^2+8f[x^3]^2+6f[x^2]^3),{x,0,nn}],x] (* _Geoffrey Critzer_, Sep 28 2013 *)

%Y Cf. A039959.

%K easy,nonn

%O 0,3

%A _Vladeta Jovovic_, May 20 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 26 09:37 EDT 2024. Contains 371991 sequences. (Running on oeis4.)