Sequences

Primes with digits (0,...,6) taken as base 7 and converted to base 10.

Primes without {8, 9} as digits.

Primes with digits (0,...,7) taken as base 8 and converted to base 10.

Primes with digits (0,...,8) taken as base 9 and converted to base 10.

Record values of the product of the exponents in the prime factorization of highly powerful numbers (A005934).

3-full (or cube-full, or cubefull) numbers: if a prime p divides n then so does p^3.

4-full numbers: if a prime p divides k then so does p^4.

Genocchi numbers (of first kind): expansion of 2*x/(exp(x)+1).

Triangle read by rows: T(n,k) = T(n-1,k-1) + k^2*T(n-1,k), 1 < k <= n, T(n,1) = 1.

Triangle of coefficients of Gandhi polynomials.

Numbers k such that the k-th Fibonacci number reversed is prime.

Numbers k such that the k-th prime is a Fibonacci number reversed.

(7*n^3+4*n^2+4*n)*binomial(2*n,n)/30.

Positions of the digit '7' in decimal expansion of Pi.

Lengths of Golay complementary sequences.

Becomes a prime if a 1 is inserted before each digit.

Primes arising in A036976.

Numbers for which the "describe what you see" transform A045918 produces a prime.

Primes arising in A036978.

Number of (2n) X (2n) symmetric matrices each of whose rows is a permutation of 1..(2n).

Number of (2n+1) X (2n+1) symmetric matrices each of whose rows is a permutation of 1..(2n+1).

a(n)=[ a*a(n-1)+b ]/p^r, where a=2.001, b=3.2, p=2 and p^r is the highest power of p dividing [ a*a(n-1)+b ].

Number of invariants in Hilbert basis for binary forms of degree n.

Number of covariants in Hilbert basis for binary forms of degree n.

Erroneous version of A036983.

Erroneous version of A036984.

Fredholm-Rueppel sequence.

Has simplest possible tree complexity of all transcendental sequences.

Read binary expansion of n from the right; keep track of the excess of 1's over 0's that have been seen so far; sequence gives 1 + maximum(excess of 1's over 0's).

Numbers n such that, in the binary expansion of n, reading from right to left, the number of 1's never exceeds the number of 0's.

Numbers k with the property that in the binary expansion of k, reading from right to left, the number of 0's never exceeds the number of 1's.

Numbers not in A036990 nor A036991.

Numbers n with property that reading from right to left in the binary expansion of n, the number of 0's always stays ahead of the number of 1's.

Numbers k with the property that reading from right to left in the binary expansion of k, the number of 1's always stays ahead of the number of 0's.

Triangle of numbers a(i,j), i+j = n >= 2, giving number of words in a certain language with i 0's, j 1's, ending with 1.

Number of isomers of alkyl homologs of adamantane with n carbon atoms.

Number of composite numbers <= n and relatively prime to n.

The number of decompositions of n into different parts relatively prime to n.

Restricted permutations.

Positions of the digit '1' in the decimal expansion of Pi.

Positions of the digit '2' in the decimal expansion of Pi (where positions 0, 1, 2,... refer to the digits 3, 1, 4,...).

Positions of the digit '3' in the decimal expansion of Pi - 3.

Positions of the digit '4' in the decimal expansion of Pi.

Positions of the digit '5' in the decimal expansion of Pi.

Positions of the digit '6' in the decimal expansion of Pi.

Positions of the digit '8' in the decimal expansion of Pi.

Positions of the digit '9' in the decimal expansion of Pi, where positions 0, 1, 2,... correspond to digits 3, 1, 4, ....

Positions of the digit '0' in the decimal expansion of Pi, where positions 0, 1, 2, ... correspond to digits 3, 1, 4, ....

Consider an n X n board with a knight's path, not necessarily closed, that visits every square exactly once; number the squares [ 1..n^2 ] along the path; a(n) = maximal number of prime numbered squares that can be attacked by a queen.

Differences between adjacent palindromic primes.