[go: up one dir, main page]

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!)
Revision History for A002896 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A002896 Number of 2n-step polygons on cubic lattice.
(history; published version)
#184 by Hugo Pfoertner at Fri Aug 02 03:13:49 EDT 2024
STATUS

reviewed

approved

#183 by Joerg Arndt at Fri Aug 02 02:20:21 EDT 2024
STATUS

proposed

reviewed

#182 by Michel Marcus at Thu Aug 01 03:08:23 EDT 2024
STATUS

editing

proposed

#181 by Michel Marcus at Thu Aug 01 03:08:14 EDT 2024
COMMENTS

Number of walks with 2n steps on the cubic lattice Z X Z X Z^3 beginning and ending at (0,0,0).

STATUS

approved

editing

Discussion
Thu Aug 01 03:08
Michel Marcus: ok ??
#180 by Michel Marcus at Thu Aug 01 03:08:00 EDT 2024
STATUS

reviewed

approved

#179 by Joerg Arndt at Thu Aug 01 02:44:29 EDT 2024
STATUS

proposed

reviewed

#178 by Jason Yuen at Thu Aug 01 02:40:10 EDT 2024
STATUS

editing

proposed

#177 by Jason Yuen at Thu Aug 01 02:39:41 EDT 2024
COMMENTS

Number of walks with 2n steps on the cubic lattice Z X Z X Z beginning and ending at (0,0,0)).).

FORMULA

a(n) = (4^n*p(1/2, n)/n!)*hypergeom([ -([-n, -n, 1/2], [1, 1], 4)), ), where p(a, k) = Product_{i=0..k-1} (a+i).

STATUS

approved

editing

#176 by Amiram Eldar at Tue Jul 25 02:45:42 EDT 2023
STATUS

reviewed

approved

#175 by Michel Marcus at Tue Jul 25 01:42:44 EDT 2023
STATUS

proposed

reviewed

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 August 29 21:13 EDT 2024. Contains 375518 sequences. (Running on oeis4.)