Sequences

Decimal expansion of exp(Pi).

Decimal expansion of Michael Trott's constant: continued fraction expansion (allowing 0's) begins in same way as decimal expansion.

Usual continued fraction for Trott's constant (not permitting internal 0's).

Numbers k such that k^4 can be written as a sum of four positive 4th powers with no common factor.

Sets of 4 consecutive numbers with equal number of divisors.

Duplicate of A020493.

Numbers k that together with their double and triple contain every digit from 1-9 exactly once.

Replaced by the pair of sequences A048611 and A048612.

Numbers n > 2 such that n - 2^k is a prime for all k > 0 with 2^k < n.

Sets of 4 numbers in arithmetic progression with common difference 6 and whose phi values are equal.

Row sums up to the main diagonal of the "postage stamp" array (n,m >= 0) defined in A007059.

Fibonacci-lucky numbers: generated by a sieve process with Fibonacci rule.

Twin Fibonacci-lucky numbers.

Palindromic Fibonacci-lucky numbers.

Prime Fibonacci-lucky numbers.

Differences between Fibonacci-lucky numbers.

Partial sums of Fibonacci-lucky numbers.

Smallest number m > 1 such that m^(p-1)-1 is divisible by p^2, where p = n-th prime.

Palindromic and prime Fibonacci-lucky numbers.

Concatenate Fibonacci-lucky numbers.

Odd Fibonacci-lucky numbers.

Even Fibonacci-lucky numbers.

Signed double Pochhammer triangle: expansion of x(x-2)(x-4)..(x-2n+2).

Erroneous version of A001232.

Numbers m such that m^2 ends in 444.

Squares which are the concatenation of two nonzero squares.

Primes of the form 3*2^k + 1.

Erroneous version of A005820.

Numbers k such that phi(k) + 1 is not a prime.

Ambitious numbers: numbers n with the property that if a number ends in n then it is divisible by n.

If n=x1x2...xm in base 10, n belongs to the sequence iff x1x2..xm*11=y1y2...ym and xm..x2x1*11=ym...y2y1.

Jabotinsky-triangle related to A039647.

Twin Fibonacci-lucky numbers (lower terms).

Twin Fibonacci-lucky numbers (upper terms).

Twin Fibonacci-lucky numbers (middle terms).

If n = Product (p_j^k_j) then a(n) = Product (p_j) + Product (k_j).

a(n) = Sum(p_j) * Sum(k_j) where n = Product(p_j^k_j).

Numbers k such that phi(k) + 1 is prime.

Number of 4-dimensional cubic lattice walks that start and end at the origin after 2n steps, free to pass through origin at intermediate stages.

Numbers k such that the largest power of 3 dividing k equals 3^omega(k).

a(n) = n-th prime modulo 3.

a(n) = n-th prime modulo 4.

a(n) = n-th prime modulo 5.

a(n) = n-th prime modulo 6.

a(n) = n-th prime modulo 7.

a(n) = n-th prime modulo 8.

Erroneous version of A005470.

a(n) = min{m: Sum_{x=0..m} binomial(n,x) >= 0.95*2^n}.

a(n) = n-th prime modulo 11.

a(n) = n-th prime modulo 12.