Sequences
392,541 sequences
- Numbers k such that sigma(k) - tau(k) is a prime.A065061
Numbers k such that sigma(k) - tau(k) is a prime.
- Numbers k such that A065608(k) = A065608(k+1).A065062
Numbers k such that A065608(k) = A065608(k+1).
- Numbers k such that A065608(k) is a square.A065063
Numbers k such that A065608(k) is a square.
- Numbers k such that A065608(k) = A065608(k+2).A065064
Numbers k such that A065608(k) = A065608(k+2).
- Number of noncrossing connected graphs with nodes on a circle having n edges.A065065
Number of noncrossing connected graphs with nodes on a circle having n edges.
- Triangle T(n,k) read by rows of partially ordered sets ("posets") with n unlabeled nodes and k maximal elements (0 <= k <= n).A065066
Triangle T(n,k) read by rows of partially ordered sets ("posets") with n unlabeled nodes and k maximal elements (0 <= k <= n).
- First differences of A065027.A065067
First differences of A065027.
- Number of fixed polyominoes with n cells of which no four are equally spaced on a straight line.A065068
Number of fixed polyominoes with n cells of which no four are equally spaced on a straight line.
- Numbers n such that Fibonacci(n) is not squarefree, but for all proper divisors k of n, Fibonacci(k) is squarefree.A065069
Numbers n such that Fibonacci(n) is not squarefree, but for all proper divisors k of n, Fibonacci(k) is squarefree.
- Rank transform of sequence {pi(m)} = A000720.A065070
Rank transform of sequence {pi(m)} = A000720.
- Minimum number of identical bricks of length 1 which, when stacked without mortar in the naive way, form a stack of length >=n.A065071
Minimum number of identical bricks of length 1 which, when stacked without mortar in the naive way, form a stack of length >=n.
- Number of ways to tile a square of side 2n by dominoes (rectangles of size 2 X 1 or 1 X 2) is 2^n * a(n)^2 (see A004003).A065072
Number of ways to tile a square of side 2n by dominoes (rectangles of size 2 X 1 or 1 X 2) is 2^n * a(n)^2 (see A004003).
- a(n) = prime(n) + (sum of digits of prime(n)).A065073
a(n) = prime(n) + (sum of digits of prime(n)).
- Near-repunit primes that contain the digit 0.A065074
Near-repunit primes that contain the digit 0.
- Sum of digits of the sum of the preceding numbers.A065075
Sum of digits of the sum of the preceding numbers.
- a(0) = 0, a(1) = 1, a(n) = (sum of digits of a(n-1)) + a(n-2).A065076
a(0) = 0, a(1) = 1, a(n) = (sum of digits of a(n-1)) + a(n-2).
- Triangle read by rows: T(n,m) = C[n,m,m] where C[i,j,k] is the 3-dimensional Catalan pyramid defined by C[0,0,0]=1 and C[i,j,k]=0 if j>i or k>j and C[i,j,k]=C[i-1,j,k]+C[i,j-1,k]+C[i,j,k-1].A065077
Triangle read by rows: T(n,m) = C[n,m,m] where C[i,j,k] is the 3-dimensional Catalan pyramid defined by C[0,0,0]=1 and C[i,j,k]=0 if j>i or k>j and C[i,j,k]=C[i-1,j,k]+C[i,j-1,k]+C[i,j,k-1].
- Triangle read by rows: a(n,m) = T[n,m,m] where T[i,j,k] is the 3-dimensional pyramid defined by T[n,m,0]=1 and T[i,j,k]=0 if j>i or k>j and T[i,j,k]=T[i-1,j,k]+T[i,j-1,k]+T[i,j,k-1].A065078
Triangle read by rows: a(n,m) = T[n,m,m] where T[i,j,k] is the 3-dimensional pyramid defined by T[n,m,0]=1 and T[i,j,k]=0 if j>i or k>j and T[i,j,k]=T[i-1,j,k]+T[i,j-1,k]+T[i,j,k-1].
- Primes > 3 for which the alternating bit sum (A065359) is not equal to 1 or 2.A065079
Primes > 3 for which the alternating bit sum (A065359) is not equal to 1 or 2.
- Denominator of Sum_{k=1..n} d(k)/k, where d() = A000005().A065080
Denominator of Sum_{k=1..n} d(k)/k, where d() = A000005().
- Alternating bit sum (A065359) for n-th prime p: replace 2^k with (-1)^k in binary expansion of p.A065081
Alternating bit sum (A065359) for n-th prime p: replace 2^k with (-1)^k in binary expansion of p.
- Numbers k such that (period of the continued fraction for sqrt(k))^3 = k.A065082
Numbers k such that (period of the continued fraction for sqrt(k))^3 = k.
- The least k such that precisely n near-repunit primes can be formed from (10^k-1)/9 by changing one digit from 1 to 0.A065083
The least k such that precisely n near-repunit primes can be formed from (10^k-1)/9 by changing one digit from 1 to 0.
- Smallest prime having alternating bit sum (A065359) equal to n.A065084
Smallest prime having alternating bit sum (A065359) equal to n.
- Smallest prime having alternating bit sum (A065359) equal to -n, or 0 if no such prime exists.A065085
Smallest prime having alternating bit sum (A065359) equal to -n, or 0 if no such prime exists.
- Number of n-digit biquanimous numbers in base 10 not allowing leading zeros.A065086
Number of n-digit biquanimous numbers in base 10 not allowing leading zeros.
- a(n) = A000166(n)*binomial(n+1,2).A065087
a(n) = A000166(n)*binomial(n+1,2).
- a(n) = A000166(n)*binomial(n,2).A065088
a(n) = A000166(n)*binomial(n,2).
- Volume (multiplied by 3) of polyhedron formed by points (i,j,k) in Z^3 with i^2+j^2+k^2 = n^2.A065089
Volume (multiplied by 3) of polyhedron formed by points (i,j,k) in Z^3 with i^2+j^2+k^2 = n^2.
- Natural numbers which are not odd primes: composites plus 1 and 2.A065090
Natural numbers which are not odd primes: composites plus 1 and 2.
- Odd primes.A065091
Odd primes.
- Primes with property that when written in base two complementing any single bit yields a composite number.A065092
Primes with property that when written in base two complementing any single bit yields a composite number.
- Convolution of A000010 with itself.A065093
Convolution of A000010 with itself.
- a(1) = 1, a(n+1) is the sum of a(n) and floor( arithmetic mean of a(1) ... a(n) ).A065094
a(1) = 1, a(n+1) is the sum of a(n) and floor( arithmetic mean of a(1) ... a(n) ).
- a(1) = 1, a(n+1) is the sum of a(n) and ceiling( arithmetic mean of a(1) ... a(n) ).A065095
a(1) = 1, a(n+1) is the sum of a(n) and ceiling( arithmetic mean of a(1) ... a(n) ).
- Sums of lists produced by a variant of the iteration that produces the Catalan numbers: start with 0 and at each iteration replace each integer k with the list 0,1,...,k-1,k,k+1,k,k-1,...,1,0 and let a(n) be the sum of the resulting (flattened) list after n iterations.A065096
Sums of lists produced by a variant of the iteration that produces the Catalan numbers: start with 0 and at each iteration replace each integer k with the list 0,1,...,k-1,k,k+1,k,k-1,...,1,0 and let a(n) be the sum of the resulting (flattened) list after n iterations.
- a(n) = ((2n+1) + (2n-1) - 1)!/((2n+1)!*(2n-1)!).A065097
a(n) = ((2n+1) + (2n-1) - 1)!/((2n+1)!*(2n-1)!).
- Sum of reciprocals of terms in period of continued fraction for sqrt(n) is an integer.A065098
Sum of reciprocals of terms in period of continued fraction for sqrt(n) is an integer.
- Weight 5 level 11 cusp form with complex multiplication by Q(sqrt(11)) and trivial character.A065099
Weight 5 level 11 cusp form with complex multiplication by Q(sqrt(11)) and trivial character.
- a(n+2) = 9*a(n+1) - a(n), a(0) = 3, a(1) = 27.A065100
a(n+2) = 9*a(n+1) - a(n), a(0) = 3, a(1) = 27.
- a(0) = c, a(1) = p*c^3; a(n+2) = p*c^2*a(n+1) - a(n), for p = 3, c = 2.A065101
a(0) = c, a(1) = p*c^3; a(n+2) = p*c^2*a(n+1) - a(n), for p = 3, c = 2.
- a(0) = c, a(1) = p*c^3; a(n+2) = p*c^2*a(n+1) - a(n), for p = 2, c = 3.A065102
a(0) = c, a(1) = p*c^3; a(n+2) = p*c^2*a(n+1) - a(n), for p = 2, c = 3.
- A level 11 weight 5 form.A065103
A level 11 weight 5 form.
- Numbers k such that for no m between k^2 and (k+1)^2 - 1 is it true that A003285(m) = A003285(m+1).A065104
Numbers k such that for no m between k^2 and (k+1)^2 - 1 is it true that A003285(m) = A003285(m+1).
- Numbers not expressible as a product of Fibonacci numbers.A065105
Numbers not expressible as a product of Fibonacci numbers.
- Smallest Fibonacci index to produce a factor p^2 (for primes p).A065106
Smallest Fibonacci index to produce a factor p^2 (for primes p).
- Start of the permutation of the primes in the order in which p^2 first appears as a factor of a number in the Fibonacci sequence.A065107
Start of the permutation of the primes in the order in which p^2 first appears as a factor of a number in the Fibonacci sequence.
- Positive numbers expressible as a product of Fibonacci numbers.A065108
Positive numbers expressible as a product of Fibonacci numbers.
- Triangle T(n,k) of coefficients relating to Bezier curve continuity.A065109
Triangle T(n,k) of coefficients relating to Bezier curve continuity.
- If n = D0*10^0 + D1*10^1 + D2*10^2 + .. + Dk*10^k define f(n) = D0*0^10 + D1*1^10 + D2*2^10 + .. + Dk*k^10 (e.g. if n = 421 then f(n) = 4*2^10 + 2*1^10 + 1*0^10 = 4098). Sequence gives values of n such that f(n) is divisible by n.A065110
If n = D0*10^0 + D1*10^1 + D2*10^2 + .. + Dk*10^k define f(n) = D0*0^10 + D1*1^10 + D2*2^10 + .. + Dk*k^10 (e.g. if n = 421 then f(n) = 4*2^10 + 2*1^10 + 1*0^10 = 4098). Sequence gives values of n such that f(n) is divisible by n.