Sequences

Shifts left under OR-convolution with itself.

Shifts left under AND-convolution with itself.

Shifts left under XOR-convolution with itself.

Shifts left under lcm-convolution with itself.

Shifts left under GCD-convolution with itself.

Exponential-convolution of triangular numbers with themselves.

Exponential-convolution of natural numbers with themselves.

Product of next n primes.

Sum of next n primes.

Shifts left 2 places under Stirling2 transform.

Shifts left when Stirling2 transform is applied twice.

Sum of digits of n a(n) is n ( = A003634/n), or 0 if no such number exists.

Shifts 2 places left when binomial transform is applied twice with a(0) = a(1) = 1.

Dimension of space of Vassiliev knot invariants of order n.

Number of circular chord diagrams with n chords, up to rotational symmetry.

a(n) is the smallest positive number such that the sum of A001032(n) consecutive squares starting with a(n)^2 is a square.

Shifts 2 places left under binomial transform.

Shifts 2 places left when convolved with itself.

Dimension of primitive Vassiliev knot invariants of order n.

Earliest sequence with a(a(a(n))) = 2n.

a(n) = denominator of sum_{k=1..n} k^(-4).

Number of subsequences of [ 1,...,n ] in which each even number has an odd neighbor.

a(n) is the number of subsequences of [ 1, ..., 2n ] in which each odd number has an even neighbor.

a(n) = 3*a(n-1) + 2*a(n-2), with a(0)=1, a(1)=5.

a(n) = 3*a(n-1) + 2*a(n-2), with a(0)=2, a(1)=7.

Number of letters in n (in Dutch) counting 'ij' as one letter.

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

Sum of 9th powers.

Primes whose reversal is a square.

a(n) = Sum_{k=1..n} k!.

Primes of form x^3 + y^3 + z^3 where x,y,z > 0.

Smallest prime > n^2.

Fibonacci(n) - (-1)^n.

Decimal expansion of Wallis's number, the real root of x^3 - 2*x - 5.

Numbers that are congruent to 0 or 2 mod 3.

Josephus problem: survivors.

Numbers n such that the decimal expansions of 2^n and 5^n contain no 0's (probably 33 is last term).

a(1) = 2, a(n) = sigma(a(n-1)).

Unique period lengths of primes mentioned in A007615.

Number of cases considered in a particular algorithm for enumerating hexaflexagrams.

Primes whose reversal in base 10 is also prime (called "palindromic primes" by David Wells, although that name usually refers to A002385). Also called reversible primes.

a(0) = 2; for n >= 0, a(n+1) = a(n)*(a(n)+1)/2.

Les Marvin sequence: a(n) = F(n) + (n-1)*F(n-1), F() = Fibonacci numbers.

Number of subgroups of dihedral group: sigma(n) + d(n).

Sum of the first n primes.

Primes of form 3*2^n - 1.

Primes p with property that p divides the sum of all primes <= p.

Decimal expansion of 2^sqrt(2).

Number of twin prime pairs below 10^n.

Numerator of Sum_{k=0..n} (-1)^k/(2*k+1).