login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002348 Degree of rational Poncelet porism of n-gon.
(Formerly M0549 N0198)
0
1, 2, 3, 4, 6, 8, 9, 12, 15, 16, 21, 24, 24, 32, 36, 36, 45, 48, 48, 60, 66, 64, 75, 84, 81, 96, 105, 96, 120, 128, 120, 144, 144, 144, 171, 180, 168, 192, 210, 192, 231, 240, 216, 264, 276, 256, 294, 300, 288, 336, 351, 324, 360, 384, 360, 420, 435, 384, 465 (list; graph; refs; listen; history; internal format)
OFFSET

3,2

REFERENCES

Kerawala, S. M.; Poncelet Porism in Two Circles. Bull. Calcutta Math. Soc. 39, 85-105, 1947.

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

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

MATHEMATICA

Poncelet[ n_Integer /; n >= 3 ] := Module[ {p, a, i}, {p, a}=Transpose[ FactorInteger[ n ] ];

If[ p[ [ 1 ] ]==2, 4^a[ [ 1 ] ]Product[ p[ [ i ] ]^(2(a[ [ i ] ]-1))(p[ [ i ] ]^2-1), {i, 2, Length[ p ]} ]/8, (* Else *) Product[ p[ [ i ] ]^(2(a[ [ i ] ]-1))(p[ [ i ] ]^2-1), {i, Length[ p ]} ]/8 ] ]

PROG

(PARI) a(n)= local(p, e); if(n<3, 0, p=factor(n)~; e=p[2, ]; p=p[1, ]; if(p[1]==2, 4^e[1], 1)* prod(i=1+(p[1]==2), length(p), p[i]^(2*(e[i]-1))* (p[i]^2-1))/8) - Michael Somos, Dec 09 1999

CROSSREFS

Sequence in context: A033501 A097273 A006446 * A019469 A081491 A048716

Adjacent sequences:  A002345 A002346 A002347 * A002349 A002350 A002351

KEYWORD

nonn,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Extended with Mathematica program by Eric Weisstein (eric(AT)weisstein.com)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 21:13 EST 2012. Contains 206085 sequences.