Sequences
392,541 sequences
- Floor[ Product of first n primes / Sum of first n primes].A067111
Floor[ Product of first n primes / Sum of first n primes].
- Let N = 2357111317192329313741434753..., the concatenation of the primes; a(n) = sum of first n digits of N.A067112
Let N = 2357111317192329313741434753..., the concatenation of the primes; a(n) = sum of first n digits of N.
- Let N = 0.149162536496481100121... = A001191, the concatenation of the squares. Then a(n) = sum of first n digits of N.A067113
Let N = 0.149162536496481100121... = A001191, the concatenation of the squares. Then a(n) = sum of first n digits of N.
- Let N = 24681012141618202224262830..., the concatenation of the even numbers. Then a(n) = sum of first n digits of N.A067114
Let N = 24681012141618202224262830..., the concatenation of the even numbers. Then a(n) = sum of first n digits of N.
- Let N = 1357911131517192123252729... = concatenation of odd numbers. Then a(n) = sum of first n digits of N.A067115
Let N = 1357911131517192123252729... = concatenation of odd numbers. Then a(n) = sum of first n digits of N.
- Floor(decimal concatenation of first n natural numbers/their sum).A067116
Floor(decimal concatenation of first n natural numbers/their sum).
- a(n) = floor((concatenation of first n natural numbers)/ (n!)).A067117
a(n) = floor((concatenation of first n natural numbers)/ (n!)).
- a(n) =floor[X/Y] where X= concatenation of first n even numbers in decreasing order and Y = that of first n odd numbers in increasing order.A067118
a(n) =floor[X/Y] where X= concatenation of first n even numbers in decreasing order and Y = that of first n odd numbers in increasing order.
- a(n) = floor[X/Y] where X = concatenation of first n even numbers in increasing order and Y = n-th triangular number.A067119
a(n) = floor[X/Y] where X = concatenation of first n even numbers in increasing order and Y = n-th triangular number.
- a(n) = floor(X/Y) where X = concatenation of first n odd numbers in increasing order and Y = n-th triangular number.A067120
a(n) = floor(X/Y) where X = concatenation of first n odd numbers in increasing order and Y = n-th triangular number.
- a(n) = floor[X/Y] where X = the concatenation of the first n even numbers in increasing order and Y = their sum.A067121
a(n) = floor[X/Y] where X = the concatenation of the first n even numbers in increasing order and Y = their sum.
- Floor[X/Y] where X = concatenation of first n odd numbers in increasing order (A019519) and Y = their sum (A000290 = n^2).A067122
Floor[X/Y] where X = concatenation of first n odd numbers in increasing order (A019519) and Y = their sum (A000290 = n^2).
- Floor[X/Y] where X = concatenation of first n cubes in increasing order and Y = concatenation of first n squares.A067123
Floor[X/Y] where X = concatenation of first n cubes in increasing order and Y = concatenation of first n squares.
- Floor [sqrt{concatenation of first n squares}].A067124
Floor [sqrt{concatenation of first n squares}].
- Floor(cube root(concatenation of first n cubes)).A067125
Floor(cube root(concatenation of first n cubes)).
- Numbers for which phi(n) >= phi(k) for all k = 1 to n-1.A067126
Numbers for which phi(n) >= phi(k) for all k = 1 to n-1.
- Composite numbers for which phi(n) >= phi(k) for all composite k from 1 to n-1.A067127
Composite numbers for which phi(n) >= phi(k) for all composite k from 1 to n-1.
- Ramanujan's largely composite numbers, defined to be numbers m such that d(m) >= d(k) for k = 1 to m-1.A067128
Ramanujan's largely composite numbers, defined to be numbers m such that d(m) >= d(k) for k = 1 to m-1.
- Numbers k such that sigma(k-3) + sigma(k+3) = sigma(2*k).A067129
Numbers k such that sigma(k-3) + sigma(k+3) = sigma(2*k).
- Numbers k such that sigma(k-1) divides sigma(k+1).A067130
Numbers k such that sigma(k-1) divides sigma(k+1).
- Number of elements in the largest set of divisors of n which are in arithmetic progression.A067131
Number of elements in the largest set of divisors of n which are in arithmetic progression.
- Number of elements in the largest set of divisors of n which are in geometric progression.A067132
Number of elements in the largest set of divisors of n which are in geometric progression.
- n is a term if the phi(n) numbers in [0,n-1] and coprime to n form an arithmetic progression.A067133
n is a term if the phi(n) numbers in [0,n-1] and coprime to n form an arithmetic progression.
- Numbers n such that sigma(n+1) = 2*sigma(n-1).A067134
Numbers n such that sigma(n+1) = 2*sigma(n-1).
- Numbers k such that sigma(k+2) = 2*sigma(k-2).A067135
Numbers k such that sigma(k+2) = 2*sigma(k-2).
- Number of Young tableaux with n cells whose shape is symmetric.A067136
Number of Young tableaux with n cells whose shape is symmetric.
- a(n) is the smallest number m such that n^(1/m) = 1.(leading zeros)n...A067137
a(n) is the smallest number m such that n^(1/m) = 1.(leading zeros)n...
- OR-numbral multiplication table, read by antidiagonals.A067138
OR-numbral multiplication table, read by antidiagonals.
- Irreducible elements in OR-numbral arithmetic.A067139
Irreducible elements in OR-numbral arithmetic.
- Primes p beginning consecutive prime-difference pattern as follows: p, (10, 2, 10, 2, 10), p+34.A067140
Primes p beginning consecutive prime-difference pattern as follows: p, (10, 2, 10, 2, 10), p+34.
- Primes p beginning consecutive prime-difference pattern as follows: p, (16, 2, 16, 2), p+36.A067141
Primes p beginning consecutive prime-difference pattern as follows: p, (16, 2, 16, 2), p+36.
- One half of the number of Young tableaux with n cells whose shape is asymmetric.A067142
One half of the number of Young tableaux with n cells whose shape is asymmetric.
- Numbers n such that phi(n+1) = 3*phi(n).A067143
Numbers n such that phi(n+1) = 3*phi(n).
- Numbers k such that sigma(phi(k)) == 0 (mod k).A067144
Numbers k such that sigma(phi(k)) == 0 (mod k).
- Shifts left under reversion.A067145
Shifts left under reversion.
- Shifts left under exponential reversion.A067146
Shifts left under exponential reversion.
- Triangle of coefficients for expressing x^n in terms of Hermite polynomials.A067147
Triangle of coefficients for expressing x^n in terms of Hermite polynomials.
- Fibonacci-like sequences. a(n) is the number of pairs of integers (n,i), 0<i<n, with Property F: i and n are consecutive terms i=b(j-1) and n=b(j), for some j>2, of a sequence {b(k)} satisfying b(1)=1, b(2)>0 and b(k)=b(k-1)+b(k-2) for all k>2.A067148
Fibonacci-like sequences. a(n) is the number of pairs of integers (n,i), 0<i<n, with Property F: i and n are consecutive terms i=b(j-1) and n=b(j), for some j>2, of a sequence {b(k)} satisfying b(1)=1, b(2)>0 and b(k)=b(k-1)+b(k-2) for all k>2.
- Indices of records of A067148.A067149
Indices of records of A067148.
- Number of integers i=1,2,...,n such that (n,i) has Property F3*, i.e., i and n are consecutive terms of a sequence b(k) satisfying b(1)=1, b(n) = (b(n-1) OR 2*b(n-1)) + b(n-2), where the OR is taken bitwise.A067150
Number of integers i=1,2,...,n such that (n,i) has Property F3*, i.e., i and n are consecutive terms of a sequence b(k) satisfying b(1)=1, b(n) = (b(n-1) OR 2*b(n-1)) + b(n-2), where the OR is taken bitwise.
- Number of regions in regular n-gon which are quadrilaterals (4-gons) when all its diagonals are drawn.A067151
Number of regions in regular n-gon which are quadrilaterals (4-gons) when all its diagonals are drawn.
- Number of pentagonal regions in regular n-gon with all diagonals drawn.A067152
Number of pentagonal regions in regular n-gon with all diagonals drawn.
- Number of hexagonal regions in regular n-gon with all diagonals drawn.A067153
Number of hexagonal regions in regular n-gon with all diagonals drawn.
- Number of heptagonal regions in regular n-gon with all diagonals drawn.A067154
Number of heptagonal regions in regular n-gon with all diagonals drawn.
- Number of octagonal regions in regular n-gon with all diagonals drawn.A067155
Number of octagonal regions in regular n-gon with all diagonals drawn.
- Number of regions in regular n-gon which are 9-gons.A067156
Number of regions in regular n-gon which are 9-gons.
- Number of regions in regular n-gon which are 10-gons.A067157
Number of regions in regular n-gon which are 10-gons.
- Number of regions in regular n-gon which are 11-gons.A067158
Number of regions in regular n-gon which are 11-gons.
- Number of regions in regular n-gon which are 12-gons.A067159
Number of regions in regular n-gon which are 12-gons.
- Numbers k such that sigma(phi(sigma(k))) = phi(sigma(phi(k))).A067160
Numbers k such that sigma(phi(sigma(k))) = phi(sigma(phi(k))).