Sequences

Weight distribution of [ 17,8,8 ] code over GF(4).

Weight distribution of [ 96,48,12 ] doubly-even self-dual "octern" code.

Fermat's Diophantine m-tuple: 1 + the product of any two distinct terms is a square.

1 + product of any two terms is a square.

a(4n)=n, a(4n+2)=a(4n)+a(4n+4), a(2n+1)=a(2n)+a(2n+2).

Speak the numbers pausing after every component.

The "Semi-Fibonacci sequence": a(1) = 1; a(n) = a(n/2) (n even); a(n) = a(n-1) + a(n-2) (n odd).

The "semi-Fibonacci numbers": a(n) = A030067(2n - 1), where A030067 is the semi-Fibonacci sequence.

Size of lexicographic code of length n, Hamming distance 8 and weight 8.

Numerator of Second Mills Number M_2(n).

Denominator of Second Mills Number M_2(n).

Numbers k such that k^2 is palindromic in base 14.

Numbers k such that k^2 is palindromic in base 15.

Squares which are palindromes in base 14.

Squares which are palindromes in base 15.

a(n) = 10 - m, where m = maximal digit of n.

Take n equally spaced points on circle, connect them by a path with n-1 line segments; sequence gives number of distinct path lengths.

Cubes of primes.

Primes p such that digits of p appear in p^2.

Primes p such that digits of p appear in p^3.

a(n) = prime^2 and digits of prime appear in a(n).

a(n) = prime^3 and digits of prime appear in a(n).

Primes p such that all digits of p^2 appear in p.

Primes p such that all digits of p^3 appear in p.

Primes p such that digits of p appear in p^2 and p^3.

Primes p whose digits do not appear in p^2.

Primes such that digits of p do not appear in p^3.

a(n) = prime^2 and digits of prime do not appear in a(n).

a(n) = prime^3 and digits of prime do not appear in a(n).

Primes p such that digits of p do not appear in p^2 or p^3 (probably finite).

Primes such that p and p^2 have same set of digits.

Primes p such that p and p^3 have the same set of digits.

Primes p such that p, p^2 and p^3 all have the same set of digits.

Product of n with 666 is palindromic.

Primes p such that 666p is palindromic.

Primes whose digits are all odd.

Numbers k such that k^2 has only even digits.

Squares whose digits are all even.

Numbers k such that k^3 has only odd digits.

Cubes whose digits are all odd.

a(n) is the number produced when n is converted to binary digits, the binary digits are reversed and then converted back into a decimal number.

Base-3 reversal of n (written in base 10).

Base 4 reversal of n (written in base 10).

Base 5 reversal of n (written in base 10).

Base 6 reversal of n (written in base 10).

Base 7 reversal of n (written in base 10).

Base 8 reversal of n (written in base 10).

Base 9 reversal of n (written in base 10).

Write n in binary, reverse bits, subtract 1, divide by 2.

a(n) = 2^n - n^2 + 1.