The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A028362 Total number of self-dual binary codes of length 2n. Totally isotropic spaces of index n in symplectic geometry of dimension 2n. 31

%I #105 Sep 27 2023 16:45:53

%S 1,3,15,135,2295,75735,4922775,635037975,163204759575,83724041661975,

%T 85817142703524375,175839325399521444375,720413716161839357604375,

%U 5902349576513949856852644375,96709997811181068404530578084375

%N Total number of self-dual binary codes of length 2n. Totally isotropic spaces of index n in symplectic geometry of dimension 2n.

%C These numbers appear in the second column of A155103. - _Mats Granvik_, Jan 20 2009

%C a(n) = n terms in the sequence (1, 2, 4, 8, 16, ...) dot n terms in the sequence (1, 1, 3, 15, 135). Example: a(5) = 2295 = (1, 2, 4, 8, 16) dot (1, 1, 3, 15, 135) = (1 + 2 + 12 + 120 + 2160). - _Gary W. Adamson_, Aug 02 2010

%D F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Elsevier-North Holland, 1978, p. 630.

%H T. D. Noe, <a href="/A028362/b028362.txt">Table of n, a(n) for n = 1..50</a>

%H C. Bachoc and P. Gaborit, <a href="http://www.numdam.org/item?id=JTNB_2000__12_2_255_0">On extremal additive F_4 codes of length 10 to 18</a>, J. Théorie Nombres Bordeaux, 12 (2000), 255-271.

%H Hsien-Kuei Hwang, Emma Yu Jin, and Michael J. Schlosser, <a href="https://arxiv.org/abs/2012.13570">Asymptotics and statistics on Fishburn Matrices: dimension distribution and a conjecture of Stoimenow</a>, arXiv:2012.13570 [math.CO], 2020.

%F a(n) = Product_{i=1..n-1} (2^i+1).

%F Letting a(0)=1, we have a(n) = Sum_{k=0..n-1} 2^k*a(k) for n>0. a(n) is asymptotic to c*sqrt(2)^(n^2-n) where c=2.384231029031371724149899288.... = A079555 = Product_{k>=1} (1 + 1/2^k). - _Benoit Cloitre_, Jan 25 2003

%F G.f.: Sum_{n>=1} 2^(n*(n-1)/2) * x^n/(Product_{k=0..n-1} (1-2^k*x)). - _Paul D. Hanna_, Sep 16 2009

%F a(n) = 2^(binomial(n,2) - 1)*(-1; 1/2)_{n}, where (a;q)_{n} is the q-Pochhammer symbol. - _G. C. Greubel_, Dec 23 2015

%F From _Antti Karttunen_, Apr 15 2017: (Start)

%F a(n) = A048675(A285101(n-1)).

%F a(n) = b(n-1), where b(0) = 1, and for n > 0, b(n) = b(n-1) + (2^n)*b(n-1).

%F a(n) = Sum_{i=1..A000124(n-1)} A053632(n-1,i-1)*(2^(i-1)) [where the indexing of both rows and columns of irregular table A053632(row,col) is considered to start from zero].

%F (End)

%F G.f. A(x) satisfies: A(x) = x * (1 + A(2*x)) / (1 - x). - _Ilya Gutkovskiy_, Jun 06 2020

%F Conjectural o.g.f. as a continued fraction of Stieltjes type (S-fraction):

%F 1/(1 - 3*x/(1 - 2*x/(1 - 10*x/(1 - 12*x/(1 - 36*x/(1 - 56*x/(1 - 136*x/(1 - 240*x/(1 - ... - 2^(n-1)*(2^n + 1)*x/(1 - 2^n*(2^n - 1)*x/(1 - ... ))))))))))). - _Peter Bala_, Sep 27 2023

%e G.f. = x + 3*x^2 + 15*x^3 + 135*x^4 + 2295*x^5 + 75735*x^6 + 4922775*x^7 + ...

%p seq(mul(1 + 2^j, j = 1..n-1), n = 1..20); # _G. C. Greubel_, Jun 06 2020

%t Table[Product[2^i+1,{i,n-1}],{n,15}] (* or *) FoldList[Times,1, 2^Range[15]+1] (* _Harvey P. Dale_, Nov 21 2011 *)

%t Table[QPochhammer[-2, 2, n - 1], {n, 15}] (* _Arkadiusz Wesolowski_, Oct 29 2012 *)

%o (PARI) {a(n)=polcoeff(sum(m=0,n,2^(m*(m-1)/2)*x^m/prod(k=0,m-1,1-2^k*x+x*O(x^n))),n)} \\ _Paul D. Hanna_, Sep 16 2009

%o (PARI) {a(n) = if( n<1, 0 , prod(k=1, n-1, 2^k + 1))}; /* _Michael Somos_, Jan 28 2018 */

%o (PARI) {a(n) = sum(k=0, n-1, 2^(k*(k+1)/2) * prod(j=1, k, (2^(n-j) - 1) / (2^j - 1)))}; /* _Michael Somos_, Jan 28 2018 */

%o (Sage)

%o from ore_algebra import *

%o R.<x> = QQ['x']

%o A.<Qx> = OreAlgebra(R, 'Qx', q=2)

%o print((Qx - x - 1).to_list([0,1], 10)) # _Ralf Stephan_, Apr 24 2014

%o (Sage)

%o from sage.combinat.q_analogues import q_pochhammer

%o [q_pochhammer(n-1,-2,2) for n in (1..20)] # _G. C. Greubel_, Jun 06 2020

%o (Magma) [1] cat [&*[ 2^k+1: k in [1..n] ]: n in [1..16]]; // _Vincenzo Librandi_, Dec 24 2015

%o (Python)

%o for n in range(2,40,2):

%o product = 1

%o for i in range(1,n//2-1 + 1):

%o product *= (2**i+1)

%o print(product)

%o # _Nathan J. Russell_, Mar 01 2016

%o (Python)

%o from math import prod

%o def A028362(n): return prod((1<<i)+1 for i in range(1,n)) # _Chai Wah Wu_, Jun 20 2022

%o (Scheme, with memoization-macro definec)

%o (define (A028362 n) (A028362off0 (- n 1)))

%o (definec (A028362off0 n) (if (zero? n) 1 (+ (A028362off0 (- n 1)) (* (expt 2 n) (A028362off0 (- n 1))))))

%o ;; _Antti Karttunen_, Apr 15 2017

%Y Cf. A000124, A003178, A003179, A028361, A028363, A048675, A053632, A068052 (XOR-analog), A285101.

%Y Cf. A155103. - _Mats Granvik_, Jan 20 2009

%Y Cf. A005329, A006088. - _Paul D. Hanna_, Sep 16 2009

%K nonn,easy,nice

%O 1,2

%A _N. J. A. Sloane_

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 June 1 14:30 EDT 2024. Contains 373025 sequences. (Running on oeis4.)