# A290952 Multi de Bruijn Sequences: Number of ways to arrange 2^(n+1) binary digits in a circle so that every length n binary string occurs exactly twice
# Submitted by Glenn Tesler
# Maple program to calculate table of n, a(n) for n=1..11:
# for n from 1 to 11 do printf("%d %d\n", n, (6^(2^(n-1))+2^(2^(n-1)))/(2^(n+1))); od;

1 2
2 5
3 82
4 52496
5 44079843328
6 62177039921456290463744
7 247422994777239366039696433386055989663945981952
8 7835921708100840781377057397856335571660942358870727003819788990112934851947892015462438777389056
9 15718827267964415539122816321852836000954017070640805097530071985609646154929575011374548153510807732904952535910999399449400628179148594832200757377589803720197512133076584052685615474622341316608
10 126505743708212045740080413826891553508168175388843576236239598072269896129032215412176584564139577409348746176291241924220469563729257088164702850021015460290711598073259812554199553030929489618609211621471174992984970324137948408773035923480537936012297356668313080311692304933743171312021518245971557631800400622165868314713421207073784314013704638638859526391201980942635474767527749965840384
11 16387792067755859555698705401023007685885387089629604837387747201724796153782770455518713860477210571174298305500071669339770036373700811326448081169964212735780892946837039686007629718527803539873669167198428120254179954610544110806693588362244446213889106833613599555759428692090888893607539360242365856525862395456571249426463813017839333009069288413503859015850897179137589476849597766703493789918568977169246939024073331775574104327734657522915025066342192202717139824094368442722358854236567004488996668567371797570481161431533104715659915987321905338486968050352966273096029156509890440918354005028954409837578858053932861455422724591813065681771115114544789952670791539019859880243679516509488519778449474904496182690717461268053177952661126015300476875280501938811920934623917241270272