Sequences
392,541 sequences
- Partial sums of 3^A007814(n).A091311
Partial sums of 3^A007814(n).
- Erroneous version of A018239.A091312
Erroneous version of A018239.
- Smallest prime x > n such that x (mod n) = x (mod prime(n)).A091313
Smallest prime x > n such that x (mod n) = x (mod prime(n)).
- Primes in A038397 (concatenate first n squares in reverse order).A091314
Primes in A038397 (concatenate first n squares in reverse order).
- Number of orbits of length n under the map whose periodic points are counted by A061684.A091315
Number of orbits of length n under the map whose periodic points are counted by A061684.
- a(1)=1, a(2)=2, then a(a(1)+a(2)+...+a(k))=a(k), fill in any undefined places with the rule a(n+1)=a(n)+1.A091316
a(1)=1, a(2)=2, then a(a(1)+a(2)+...+a(k))=a(k), fill in any undefined places with the rule a(n+1)=a(n)+1.
- Primes p that divide 2^n+1 for some n.A091317
Primes p that divide 2^n+1 for some n.
- Lengths of runs of 1's in A039702.A091318
Lengths of runs of 1's in A039702.
- Number of orientable hyperbolic 3-manifolds of cusp type 1 obtained from n ideal tetrahedra.A091319
Number of orientable hyperbolic 3-manifolds of cusp type 1 obtained from n ideal tetrahedra.
- Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges and k leaves.A091320
Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges and k leaves.
- OU-Sigma multiperfect numbers.A091321
OU-Sigma multiperfect numbers.
- k-values associated with A091321.A091322
k-values associated with A091321.
- Minimum number of transversals in a Latin square of order 2n+1.A091323
Minimum number of transversals in a Latin square of order 2n+1.
- (2^n)^(2^n)-(2^n-1)^(2^n).A091324
(2^n)^(2^n)-(2^n-1)^(2^n).
- Triangle T(n,k) read by rows giving number of inequivalent even binary linear [n,k] codes (n >= 1, 0 <= k <= n-1).A091325
Triangle T(n,k) read by rows giving number of inequivalent even binary linear [n,k] codes (n >= 1, 0 <= k <= n-1).
- Total number of inequivalent even binary linear codes of length n and any dimension k = 0, 1, ..., n-1.A091326
Total number of inequivalent even binary linear codes of length n and any dimension k = 0, 1, ..., n-1.
- Triangle T(n,k) read by rows giving number of inequivalent even binary linear [n,k] codes containing no zero columns (n >= 2, 1 <= k <= n-1).A091327
Triangle T(n,k) read by rows giving number of inequivalent even binary linear [n,k] codes containing no zero columns (n >= 2, 1 <= k <= n-1).
- Total number of inequivalent even binary linear codes of length n and any dimension k = 0, 1, ..., n-1, with no column of zeros.A091328
Total number of inequivalent even binary linear codes of length n and any dimension k = 0, 1, ..., n-1, with no column of zeros.
- Bar coding for digits 0 through 9 in Universal Product Code (or UPC).A091329
Bar coding for digits 0 through 9 in Universal Product Code (or UPC).
- a(n) = ((p-1)!/p) - ((p-1)*(p-1)!/p!), where p is the n-th prime.A091330
a(n) = ((p-1)!/p) - ((p-1)*(p-1)!/p!), where p is the n-th prime.
- Natural numbers written out with their digits grouped in triples (leading zeros omitted).A091331
Natural numbers written out with their digits grouped in triples (leading zeros omitted).
- Natural numbers written out with their digits grouped in sets of four (leading zeros omitted).A091332
Natural numbers written out with their digits grouped in sets of four (leading zeros omitted).
- Number of 1's required to build n using +, -, *, and parentheses.A091333
Number of 1's required to build n using +, -, *, and parentheses.
- Number of 1's required to build n using +, -, *, ^, and parentheses.A091334
Number of 1's required to build n using +, -, *, ^, and parentheses.
- Number of prime divisors of n-th term of Sylvester's sequence A000058.A091335
Number of prime divisors of n-th term of Sylvester's sequence A000058.
- Number of prime divisors of A000058(n)-1 = A000058(0)*...*A000058(n-1).A091336
Number of prime divisors of A000058(n)-1 = A000058(0)*...*A000058(n-1).
- a(n) = (2/n), where (k/n) is the Kronecker symbol.A091337
a(n) = (2/n), where (k/n) is the Kronecker symbol.
- a(n) = (3/n), where (k/n) is the Kronecker symbol.A091338
a(n) = (3/n), where (k/n) is the Kronecker symbol.
- a(n) = a(n-1)*a(n-2) + (n-2); a(1) = 1, a(2) = 2.A091339
a(n) = a(n-1)*a(n-2) + (n-2); a(1) = 1, a(2) = 2.
- Amicable numbers with property that each member m of the corresponding amicable pair is divisible by sopfr(m) (the sum of prime factors with repetition, A001414).A091340
Amicable numbers with property that each member m of the corresponding amicable pair is divisible by sopfr(m) (the sum of prime factors with repetition, A001414).
- Natural numbers written out with their digits grouped in sets of 5 (leading zeros omitted).A091341
Natural numbers written out with their digits grouped in sets of 5 (leading zeros omitted).
- Given (1) f(h,j,a) = ( [ ((a/gcd(a,h)) / gcd(j+1,(a/gcd(a,h)))) * (h(j+1)) ] - [ ((a/gcd(a,h)) / gcd(j+1,(a/gcd(a,h)))) * (ja) ] ) / a then let (2) a(h) = d(h,j) = lcm( f(h,j,1) ... f(h,j,h) ).A091342
Given (1) f(h,j,a) = ( [ ((a/gcd(a,h)) / gcd(j+1,(a/gcd(a,h)))) * (h(j+1)) ] - [ ((a/gcd(a,h)) / gcd(j+1,(a/gcd(a,h)))) * (ja) ] ) / a then let (2) a(h) = d(h,j) = lcm( f(h,j,1) ... f(h,j,h) ).
- Decimal expansion of Gamma(1/4)/(2*Pi^(3/4)).A091343
Decimal expansion of Gamma(1/4)/(2*Pi^(3/4)).
- a(n) = 2*3^n - 3*2^n + 1.A091344
a(n) = 2*3^n - 3*2^n + 1.
- Exponential convolution of A069321(n) with itself, where we set A069321(0)=0.A091345
Exponential convolution of A069321(n) with itself, where we set A069321(0)=0.
- Binomial convolution of A069321(n), where A069321(0)=0, with the sequence of all 1's alternating in sign.A091346
Binomial convolution of A069321(n), where A069321(0)=0, with the sequence of all 1's alternating in sign.
- a(n) = 6*4^n - 12*3^n + 7*2^n - 1.A091347
a(n) = 6*4^n - 12*3^n + 7*2^n - 1.
- a(n) = 24*5^n - 60*4^n + 50*3^n - 15*2^n + 1.A091348
a(n) = 24*5^n - 60*4^n + 50*3^n - 15*2^n + 1.
- Decimal expansion of Sum_{m>=1, n>=1} 1/(m^2*(m^2 + m*n + n^2)).A091349
Decimal expansion of Sum_{m>=1, n>=1} 1/(m^2*(m^2 + m*n + n^2)).
- First occurrence (*2) of n in A088627 - or - least number that yields n different primes if you factorize it in all possible ways in two factors and add these factors.A091350
First occurrence (*2) of n in A088627 - or - least number that yields n different primes if you factorize it in all possible ways in two factors and add these factors.
- Triangle T, read by rows, such that T(n,k) equals the (n-k)-th row sum of T^k, where T^k is the k-th power of T as a lower triangular matrix.A091351
Triangle T, read by rows, such that T(n,k) equals the (n-k)-th row sum of T^k, where T^k is the k-th power of T as a lower triangular matrix.
- Row sums of triangle A091351, in which the k-th column lists the row sums of the k-th power of A091351 (when considered as a lower triangular matrix).A091352
Row sums of triangle A091351, in which the k-th column lists the row sums of the k-th power of A091351 (when considered as a lower triangular matrix).
- Row sums of the matrix square of triangle A091351, in which the k-th column lists the row sums of A091351^k (the k-th power of A091351 when considered as a lower triangular matrix).A091353
Row sums of the matrix square of triangle A091351, in which the k-th column lists the row sums of A091351^k (the k-th power of A091351 when considered as a lower triangular matrix).
- Row sums of the matrix cube of triangle A091351, in which the k-th column lists the row sums of A091351^k (the k-th power of A091351 when considered as a lower triangular matrix).A091354
Row sums of the matrix cube of triangle A091351, in which the k-th column lists the row sums of A091351^k (the k-th power of A091351 when considered as a lower triangular matrix).
- Triangle read by rows: T(n,k) = number of planar partitions of n with k rows.A091355
Triangle read by rows: T(n,k) = number of planar partitions of n with k rows.
- Number of planar partitions of n with exactly 2 rows.A091356
Number of planar partitions of n with exactly 2 rows.
- Number of planar partitions of n with exactly 3 rows.A091357
Number of planar partitions of n with exactly 3 rows.
- Number of planar partitions of n with exactly 4 rows.A091358
Number of planar partitions of n with exactly 4 rows.
- Number of planar partitions of n with exactly 5 rows.A091359
Number of planar partitions of n with exactly 5 rows.
- Partial sums of A000219.A091360
Partial sums of A000219.