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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007227 Number of distinct perforation patterns for deriving (v,b)=(n+2,n) punctured convolutional codes from (3,1).
(Formerly M4624)
0

%I M4624

%S 9,42,236,1287,7314,41990,245256,1448655,8649823,52106040,316360752,

%T 1933910820,11893566078,73537906926,456864894288,2850557192175,

%U 17854854154215,112230508880490,707714010205020,4475876883386895

%N Number of distinct perforation patterns for deriving (v,b)=(n+2,n) punctured convolutional codes from (3,1).

%D G. Begin, On the enumeration of perforation patterns for punctured convolutional codes, Séries Formelles et Combinatoire Algébrique, 4th colloquium, 15-19 Juin 1992, Montréal, Université du Québec à Montréal, pp. 1-10.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%p with(numtheory):P:=proc(b,v0) local k: RETURN(add(phi(k)*(1+z^k)^(v0*(b/k)),k=divisors(b))/b): end; seq(coeff(P(b,3),z,b+2),b=2..40); (Pab Ter)

%K nonn

%O 2,1

%A _Simon Plouffe_

%E More terms from Pab Ter (pabrlos2(AT)yahoo.com), Nov 13 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 25 22:17 EDT 2019. Contains 323576 sequences. (Running on oeis4.)