Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A000095
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A000095 Number of fixed points of GAMMA_0 (n) of type i. +0
1
1, 2, 0, 0, 2, 0, 0, 0, 0, 4, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 4, 0, 0, 2, 0, 0, 0, 0, 4, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 2, 0, 0, 0, 0, 4, 0, 0, 2, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 2, 4, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 4, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0 (list; graph; listen)
OFFSET

1,2

REFERENCES

B. Schoeneberg, Elliptic Modular Functions, Springer-Verlag, NY, 1974, p. 101.

G. Shimura, Introduction to the Arithmetic Theory of Automorphic Functions, Princeton, 1971, see p. 25, Eq. (2).

FORMULA

Multiplicative with a(2)=2, a(2^e)=0 if e>1, a(p^e)=2 if p=1 mod 4 and a(p^e)=0 if p=3 mod 4. - Michael Somos, Jul 15 2004

MAPLE

A000095 := proc(n) local b, d: if irem(n, 4) = 0 then RETURN(0); else b := 1; for d from 2 to n do if irem(n, d) = 0 and isprime(d) then b := b*(1+legendre(-1, d)); fi; od; RETURN(b); fi: end;

MATHEMATICA

A000095[ 1 ] = 1; A000095[ n_Integer ] := If[ Mod[ n, 4 ]==0, 0, Fold[ #1*(1+JacobiSymbol[ -1, #2 ])&, If[ EvenQ[ n ], 2, 1 ], Select[ First[ Transpose[ FactorInteger[ n ] ] ], OddQ ] ] ]

PROGRAM

(PARI) a(n)=local(t); if(n<=1|n%4==0, n==1, t=1; fordiv(n, d, if(isprime(d), t*=(1+kronecker(-1, d)))); t) /* Michael Somos, Jul 15 2004 */

CROSSREFS

Sequence in context: A107494 A079205 A107497 this_sequence A034949 A112301 A134013

Adjacent sequences: A000092 A000093 A000094 this_sequence A000096 A000097 A000098

KEYWORD

nonn,easy,mult

AUTHOR

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

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 December 16 13:01 EST 2009. Contains 170825 sequences.


AT&T Labs Research