[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 A242087 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A242087 Number of balanced orbitals over an odd number of sectors.
(history; published version)
#13 by Peter Luschny at Fri May 23 13:53:48 EDT 2014
STATUS

reviewed

approved

#12 by Peter Luschny at Fri May 23 13:51:41 EDT 2014
STATUS

proposed

reviewed

#11 by Hans Havermann at Fri May 23 06:45:05 EDT 2014
STATUS

editing

proposed

Discussion
Fri May 23 13:51
Peter Luschny: Thanks!
#10 by Hans Havermann at Fri May 23 06:44:16 EDT 2014
DATA

1, 0, 6, 6, 36, 88, 376, 1096, 4476, 14200, 57284, 190206, 764812, 2615268, 10499504, 36677626, 147110276, 522288944

EXTENSIONS

a(17) from Hans Havermann, May 23 2014

STATUS

approved

editing

#9 by Bruno Berselli at Sun May 11 17:51:36 EDT 2014
STATUS

proposed

approved

#8 by Peter Luschny at Sun May 11 06:51:56 EDT 2014
STATUS

editing

proposed

#7 by Peter Luschny at Sun May 11 06:49:42 EDT 2014
COMMENTS

See A241810 and A232500 for the combinatorial definitions.

MATHEMATICA

np[z_]:=Module[{i, j}, For[i=Length[z], i>1&&z[[i-1]]>=z[[i]], i--]; --]; For[j=Length[z], z[[j]]<=z[[i-1]], j--]; --]; Join[Take[z, i-2], {z[[j]]}, ]]}, Reverse[Drop[ReplacePart[z, z[[i-1]], j], i-1]]]]; ]]]]; o=Table[1, {16}];

Print[1]; ]; Do[p=Join[-Take[o, n], {0}, Take[o, n]]; ]]; c=0; ; Do[If[Accumulate[Accumulate[p]][[-1]]==0, c++]; ++]; p=np[p], {(2*n+1)!/(2*n!^2)}]; )}]; Print[2*c], {n, 16}]

KEYWORD

nonn,changed,more

#6 by Hans Havermann at Sat May 10 10:57:28 EDT 2014
DATA

1, 0, 6, 6, 36, 88, 376, 1096, 4476, 14200, 57284, 190206, 764812, 2615268, 10499504, 36677626, 147110276

MATHEMATICA

Print[1]; Do[p=Join[-Take[o, n], {0}, Take[o, n]]; c=0; Do[If[Accumulate[Accumulate[p]][[-1]]==0, c++]; p=np[p], {(2*n+1)!/)!/(2*n!^2}]; )}]; Print[2*c], {n, 0, 16}]

(* Hans Havermann, May 0510 2014 *)

EXTENSIONS

More terms from Hans Havermann, May 10 2014

Discussion
Sat May 10 12:53
Peter Luschny: Thank you Hans!
#5 by Hans Havermann at Mon May 05 16:02:36 EDT 2014
MATHEMATICA

Do[p=Join[-Take[o, n], {0}, Take[o, n]]; c=0; Do[If[Accumulate[Accumulate[p]][[-1]]==0, c++]; p=np[p], {(2*n+1)!/n!^2}]; Print[c], {n, 0, 16}] (* _Hans Havermann_, May 05 2014 *)}]

(* Hans Havermann, May 05 2014 *)

#4 by Hans Havermann at Mon May 05 15:35:49 EDT 2014
MATHEMATICA

np[z_]:=Module[{i, j}, For[i=Length[z], i>1&&z[[i-1]]>=z[[i]], i--]; For[j=Length[z], z[[j]]<=z[[i-1]], j--]; Join[Take[z, i-2], {z[[j]]}, Reverse[Drop[ReplacePart[z, z[[i-1]], j], i-1]]]]; o=Table[1, {16}];

Do[p=Join[-Take[o, n], {0}, Take[o, n]]; c=0; Do[If[Accumulate[Accumulate[p]][[-1]]==0, c++]; p=np[p], {(2*n+1)!/n!^2}]; Print[c], {n, 0, 16}] (* Hans Havermann, May 05 2014 *)

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 31 11:13 EDT 2024. Contains 375560 sequences. (Running on oeis4.)