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

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007229 Number of distinct perforation patterns for deriving (v,b)=(n+2,n) punctured convolutional codes from (4,1).
(Formerly M5267)
0
38, 264, 2016, 15504, 122661, 986700, 8064576, 66756144, 558689224, 4719593312, 40193414112, 344721646640, 2974925353455, 25814778578820, 225105551191680, 1971557711151600, 17336058626562984, 152984380665537760 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,1

REFERENCES

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.

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

LINKS

Table of n, a(n) for n=2..19.

MAPLE

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, 4), z, b+2), b=2..40); (Pab Ter)

CROSSREFS

Sequence in context: A165068 A160281 A186119 * A297799 A204070 A242209

Adjacent sequences:  A007226 A007227 A007228 * A007230 A007231 A007232

KEYWORD

nonn

AUTHOR

Simon Plouffe

EXTENSIONS

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

STATUS

approved

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 December 18 16:22 EST 2018. Contains 318229 sequences. (Running on oeis4.)