The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A010092 Weight distribution of d=4 Hamming code of length 63. 1
 1, 0, 9765, 1057224, 60544953, 1996794072, 41694856749, 584173436400, 5724932809365, 40448633569680, 210758816714985, 823875120414360, 2447745309517725, 5580858785942664, 9832942289229633, 13449656041565856 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 REFERENCES F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1978, p. 129. LINKS Georg Fischer, Table of n, a(n) for n = 0..30 FORMULA a(n) = A010087(2n). - Georg Fischer, Jul 14 2020 MATHEMATICA m:=63; RecurrenceTable[{a[n]==(Binomial[m, n-1]-a[n-1]-(m-n+2)*a[n-2])/n, a [0]==1, a[1]==0}, a, {n, 0, m}][[1;; m-2;; 2]] (* Georg Fischer, Jul 14 2020; from the reference, p. 129 *) CROSSREFS Cf. A010087. Sequence in context: A204286 A242878 A247696 * A023339 A145209 A035911 Adjacent sequences: A010089 A010090 A010091 * A010093 A010094 A010095 KEYWORD nonn,fini,full AUTHOR STATUS approved

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.

Last modified November 29 18:13 EST 2022. Contains 358431 sequences. (Running on oeis4.)