Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005825
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005825 Worst case of a Jacobi symbol algorithm.
(Formerly M4404)
+0
1
0, 1, 7, 31, 145, 659, 3013, 13739, 62685, 285931 (list; graph; listen)
OFFSET

0,3

REFERENCES

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures}, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

Shallit, Jeffrey; On the worst case of three algorithms for computing the Jacobi symbol. J. Symbolic Comput. 10 (1990), no. 6, 593-610.

LINKS

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures}, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

MAPLE

A005825:=z*(-1-2*z+4*z**2)/(2*z**2-1)/(1-5*z+2*z**2); [Conjectured by S. Plouffe in his 1992 dissertation.]

CROSSREFS

Adjacent sequences: A005822 A005823 A005824 this_sequence A005826 A005827 A005828

Sequence in context: A033474 A001896 A044049 this_sequence A086901 A003526 A121517

KEYWORD

nonn

AUTHOR

njas, Jeffrey Shallit

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 9 14:06 EDT 2008. Contains 144831 sequences.


AT&T Labs Research