Sequences

Triangle read by rows: number of compositions of n into relatively prime summands.

Triangle related to number of compositions of n into relatively prime summands.

Triangular "Fibonacci array".

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

Smallest k such that k(p-1)-1 is positive and divisible by p where p = n-th prime.

Concatenation of the decimal digits of Pi-3.

Number of orderings of 1,2,...,n^2 in an n X n matrix such that each row, each column and both diagonals are increasing.

Partial sums of decimal digits of Pi (ignoring the initial 3).

Related to enumeration of edge-rooted catafusenes.

Concatenation of the first n decimal digits of e-2.

Continued fraction expansion of w = 2*cos(Pi/7).

Continued fraction for root of x^5 - x - 1.

Continued fraction for 2^(1/3) + sqrt(3).

G.f.: Sum_{k>=0} x^(k^2)*(-1)^k/(Product_{i=1..k} 1-x^i).

Random digits.

Random digits obtained from a random physical process.

Number of types of maximal mixed orthogonal arrays with n runs.

Sum of first n terms of A_n (using absolute values of terms).

Second column of Fibonacci Jabotinsky-triangle A039692.

Height of lattice of parameters of mixed orthogonal arrays with n runs and strength 2.

Number of different sets of parameters for mixed orthogonal arrays with n runs and strength 2.

Smallest number k for which k, 2k, ... nk all contain the digit 1.

Smallest k for which k, 2k, ... n*k all contain the digit 2.

Smallest k for which k, 2*k, ..., n*k all contain the digit 3.

Smallest k for which k, 2k, ... nk all contain the digit 4.

Smallest k for which k, 2k, ... nk all contain the digit 5.

Smallest k for which k, 2k, ... nk all contain the digit 6.

Smallest k for which k, 2k, ... nk all contain the digit 7.

Smallest k for which k, 2k, ... nk all contain the digit 8.

Smallest k for which k, 2k, ... nk all contain the digit 9.

Alternately add and multiply.

Number of points needed to display n on the LCD (liquid-crystal display) of a TI-83 calculator.

Every integer eventually goes to one of these under the "x goes to sum of squares of digits of x" map.

Undulating palindromic primes of form ABABAB...BA with alternating prime and nonprime digits.

Maris-McGwire numbers(2): numbers k such that f(k) = f(k+1), where f(k) = sum of digits of k + sum of digits of the distinct prime factors of k.

Expansion of Molien series for 8-dimensional complex Clifford group of genus 3 and order 743178240.

Erroneous version of A039952.

A triangle related to A000045 (Fibonacci numbers).

Primes of the form 30n - 13.

Primes of form abs(2*n^2-199).

a(n) is the smallest prime p such that p^2 divides n^(p-1) - 1.

Maximum cardinality of finite D0L sequence over an alphabet with n symbols.

Triangle of "canonical" optimal Golomb rulers.

Palindromic primes formed from the reflected decimal expansion of Pi.

Squarefree numbers congruent to 1 (mod 4).

Even squarefree numbers.

Squarefree numbers congruent to 3 mod 4.

Class number of maximal order in real quadratic field of radicand n.

Number of ways of numbering the vertices of a cube so sum of the 8 numbers is n.

For n >= 2, a(n) = largest value of k such that n^k is <= n! (a(0) = a(1) = 1 by convention).