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!)
A328995 Dirichlet g.f. = Product_{primes p == 1 mod 3} (1+p^(-s))/(1-p^(-s)). 0

%I #13 Sep 20 2020 15:14:45

%S 1,2,2,2,0,2,2,2,2,0,2,2,2,2,0,4,2,2,2,0,0,2,4,2,0,2,2,2,2,0,2,0,2,2,

%T 0,2,4,2,2,0,2,4,0,4,0,2,2,2,0,0,4,2,2,0,0,2,2,2,2,0,2,2,2,2,0,0,2,4,

%U 2,0,2,4,2,2,0,0,2,2,4,0,4,2,0,2,0

%N Dirichlet g.f. = Product_{primes p == 1 mod 3} (1+p^(-s))/(1-p^(-s)).

%D Baake, Michael, and Peter AB Pleasants. "Algebraic solution of the coincidence problem in two and three dimensions." Zeitschrift für Naturforschung A 50.8 (1995): 711-717. See p. 713.

%D Baake, M. and P. A. B. Pleasants. "The coincidence problem for crystals and quasicrystals." Aperiodic, vol. 94, pp. 25-29. 1995.

%H Baake, Michael, and Peter AB Pleasants, <a href="/A031358/a031358.pdf">Algebraic solution of the coincidence problem in two and three dimensions</a>, Zeitschrift für Naturforschung A 50.8 (1995): 711-717. [Annotated scan of page 713 only].

%o (PARI) t1=direuler(p=2,2400,(1+(p%3<2)*X))

%o t2=direuler(p=2,2400,1/(1-(p%3<2)*X))

%o t3=dirmul(t1,t2)

%o t4=vector(200,n,t3[6*n+1]) \\ (and then prepend 1)

%Y Cf. A031358.

%K nonn

%O 0,2

%A _N. J. A. Sloane_, Nov 14 2019

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 30 21:10 EDT 2024. Contains 375548 sequences. (Running on oeis4.)