cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

User: Darse Billings

Darse Billings's wiki page.

Darse Billings has authored 3 sequences.

A166315 Lexicographically earliest binary de Bruijn sequences, B(2,n).

Original entry on oeis.org

1, 3, 23, 2479, 73743071, 151050438420815295, 1360791906900646753867474206897715071, 228824044090659455778900855050322128002759787305348791014476408721956007679
Offset: 1

Author

Darse Billings, Oct 11 2009

Keywords

Comments

Term a(n) is a cyclical bit string of length 2^n, with every possible substring of length n occurring exactly once.
Mathworld says: "Every de Bruijn sequence corresponds to an Eulerian cycle on a de Bruijn graph. Surprisingly, it turns out that the lexicographic sequence of Lyndon words of lengths divisible by n gives the lexicographically earliest de Bruijn sequence (Ruskey). de Bruijn sequences can be generated by feedback shift registers (Golomb 1967; Ronse 1984; Skiena 1990, p. 196)."
Terms grow like Theta(2^(2^n)). - Darse Billings, Oct 18 2009

Examples

			Example: For n = 3, the first de Bruijn sequence, a(n) = B(2,3), is '00010111' = 23.
		

Crossrefs

Cf. A166316 (Lexicographically largest de Bruijn sequences (binary complements)).

Programs

  • Python
    # See Links.

Extensions

a(6)-a(8) from Darse Billings, Oct 18 2009

A166316 Lexicographically largest binary de Bruijn sequences, B(2,n).

Original entry on oeis.org

2, 12, 232, 63056, 4221224224, 18295693635288736320, 338921575014037816709507133224870496384, 115563265193225535967792084153637585725267224878335215248443107599191173632256
Offset: 1

Author

Darse Billings, Oct 11 2009

Keywords

Comments

Term a(n) is a cyclical bit string of length 2^n, with every possible substring of length n occurring exactly once.
Mathworld says: "Every de Bruijn sequence corresponds to an Eulerian cycle on a de Bruijn graph. Surprisingly, it turns out that the lexicographic sequence of Lyndon words of lengths divisible by n gives the lexicographically earliest de Bruijn sequence (Ruskey). de Bruijn sequences can be generated by feedback shift registers (Golomb 1967; Ronse 1984; Skiena 1990, p. 196)."
Terms grow like Theta(2^(2^n)). - Darse Billings, Oct 18 2009

Examples

			For n = 3, the last de Bruijn sequence, a(n) = B(2,3), is '11101000' = 232.
		

Crossrefs

Cf. A166315 (lexicographically earliest de Bruijn sequences (binary complements)).

Extensions

a(6)-a(8) from Darse Billings, Oct 18 2009

A131690 a(n) = Product_{k=1..n} A008578(k)^A008578(n-k+1).

Original entry on oeis.org

1, 2, 12, 360, 151200, 2095632000, 7551819475200000, 7286477990937425280000000, 16326289449604557795871699200000000000, 48235535472088469901966394717904245153920000000000000, 1927704301314417844667587261525561805756528196513768633600000000000000000
Offset: 1

Author

Darse Billings, Sep 14 2007

Keywords

Comments

Exponents of the prime factorization are the primes in reverse order. Similar to A087315, but where the largest prime factor has an exponent of one instead of two (and 1^n is understood to be the first term).

Examples

			a(5) = 1^7 * 2^5 * 3^3 * 5^2 * 7^1 = 151200.
		

Crossrefs

Programs

  • Mathematica
    s={};Do[p1=Join[{1},Prime[Range[n-1]]];AppendTo[s,Product[p1[[k]]^p1[[n-k+1]],{k,n}]],{n,11}];s (* James C. McMahon, Feb 27 2025 *)

Formula

a(n) = Product_{k=1..n} A008578(k)^A008578(n-k+1) where A008578 is the sequence of primes prepended with 1.

Extensions

a(11) from James C. McMahon, Feb 27 2025