Sequences
392,541 sequences
- Lexicographically least sequence such that a(n) is a positive multiple of the n-th composite number and the arithmetic mean of the first n terms is an integer.A095211
Lexicographically least sequence such that a(n) is a positive multiple of the n-th composite number and the arithmetic mean of the first n terms is an integer.
- a(n) = arithmetic mean of A095211(1 to n).A095212
a(n) = arithmetic mean of A095211(1 to n).
- Least number that can be expressed as the sum of at least three successive terms of an arithmetic progression with positive terms in n distinct ways.A095213
Least number that can be expressed as the sum of at least three successive terms of an arithmetic progression with positive terms in n distinct ways.
- a(n) = floor((Pi/sqrt(2))^n).A095214
a(n) = floor((Pi/sqrt(2))^n).
- Beginning with 2, greatest prime divisor of the concatenation of all previous terms.A095215
Beginning with 2, greatest prime divisor of the concatenation of all previous terms.
- Smallest prime divisor of n-th partial concatenation is prime(n).A095216
Smallest prime divisor of n-th partial concatenation is prime(n).
- Greatest prime divisor of n-th partial concatenation is prime(n).A095217
Greatest prime divisor of n-th partial concatenation is prime(n).
- (Product of composite numbers among next n numbers) - (product of primes among next n numbers).A095218
(Product of composite numbers among next n numbers) - (product of primes among next n numbers).
- First differences of A053067.A095219
First differences of A053067.
- Least multiple of prime(n) beginning with the concatenation of first n primes.A095220
Least multiple of prime(n) beginning with the concatenation of first n primes.
- (Concatenation 1,2,3,...,n) mod n.A095221
(Concatenation 1,2,3,...,n) mod n.
- (Concatenation of T(n)+1..T(n+1)) mod (concatenation of T(n-1)+1..T(n)), where T(k) is the k-th triangular number, A000217(k).A095222
(Concatenation of T(n)+1..T(n+1)) mod (concatenation of T(n-1)+1..T(n)), where T(k) is the k-th triangular number, A000217(k).
- a(n) is the least Fibonacci number such that a(n) - a(n-1) is prime; a(0)=1.A095223
a(n) is the least Fibonacci number such that a(n) - a(n-1) is prime; a(0)=1.
- Least squarefree Fibonacci number with exactly n prime divisors.A095224
Least squarefree Fibonacci number with exactly n prime divisors.
- Triangle read by rows in which the n-th row contains the n smallest triangular numbers with the least significant digits of the n-th triangular number.A095225
Triangle read by rows in which the n-th row contains the n smallest triangular numbers with the least significant digits of the n-th triangular number.
- Diagonal of the triangle A095225.A095226
Diagonal of the triangle A095225.
- Numbers which can be partitioned into distinct parts all using the same digit.A095227
Numbers which can be partitioned into distinct parts all using the same digit.
- n-th decimal digit of 1/n!.A095228
n-th decimal digit of 1/n!.
- a(1) = 1; a(n) = n multiplied by the concatenation of all previous terms.A095229
a(1) = 1; a(n) = n multiplied by the concatenation of all previous terms.
- a(1) = 1, a(n+1) = Floor [concatenation of all previous terms / n].A095230
a(1) = 1, a(n+1) = Floor [concatenation of all previous terms / n].
- a(1)=1; a(n)=least positive integer such that the concatenation of all terms, including a(n), is == 1 (mod n).A095231
a(1)=1; a(n)=least positive integer such that the concatenation of all terms, including a(n), is == 1 (mod n).
- a(1) = 1, a(n+1) = floor(a(n)*10^n/n).A095232
a(1) = 1, a(n+1) = floor(a(n)*10^n/n).
- a(n) = a(n-1) + Sum(floor(n/p): p prime), a(1) = 1.A095233
a(n) = a(n-1) + Sum(floor(n/p): p prime), a(1) = 1.
- a(1) = 1, a(n) = n+a(n-1) if n does not divide a(n-1), else a(n) = n*a(n-1).A095234
a(1) = 1, a(n) = n+a(n-1) if n does not divide a(n-1), else a(n) = n*a(n-1).
- Wasteful numbers: may be described using fewer letters than are in the usual name.A095235
Wasteful numbers: may be described using fewer letters than are in the usual name.
- Given a row of n payphones (or phone booths), all initially unused, sequence gives number of ways for n people to choose the payphones assuming each always chooses one of the most distant payphones from those in use already.A095236
Given a row of n payphones (or phone booths), all initially unused, sequence gives number of ways for n people to choose the payphones assuming each always chooses one of the most distant payphones from those in use already.
- a(1)=1; then for n even, a(n)=(sum of previous terms times n) plus 1, for n odd, a(n)=(sum of previous terms times n) minus 1.A095237
a(1)=1; then for n even, a(n)=(sum of previous terms times n) plus 1, for n odd, a(n)=(sum of previous terms times n) minus 1.
- a(1) = 1, a(n) = n*(sum of all previous terms mod n).A095238
a(1) = 1, a(n) = n*(sum of all previous terms mod n).
- Analog of A095236 when the phones are arranged in a circle.A095239
Analog of A095236 when the phones are arranged in a circle.
- Variant of A095236, where first two people choose payphones at the ends.A095240
Variant of A095236, where first two people choose payphones at the ends.
- Duplicate of A061839.A095241
Duplicate of A061839.
- a(n) = smallest positive number such that concatenation a(1)...a(n) is divisible by n-th prime.A095242
a(n) = smallest positive number such that concatenation a(1)...a(n) is divisible by n-th prime.
- a(n) = concatenation of 1,2,3,...,n mod prime(n).A095243
a(n) = concatenation of 1,2,3,...,n mod prime(n).
- a(n) = concatenation n,n-1,n-2,...,3,2,1 mod (prime(n)).A095244
a(n) = concatenation n,n-1,n-2,...,3,2,1 mod (prime(n)).
- (Concatenation of first n primes) modulo prime(n).A095245
(Concatenation of first n primes) modulo prime(n).
- a(n) is chosen to be the least number such that concatenation a(1)a(2)a(3)...a(n-1)a(n) is congruent to n (mod prime(n)).A095246
a(n) is chosen to be the least number such that concatenation a(1)a(2)a(3)...a(n-1)a(n) is congruent to n (mod prime(n)).
- Least k such that the concatenation a(1), a(2), a(3), ..., a(n-1), a(n) is divisible by n if and only if n is not a prime.A095247
Least k such that the concatenation a(1), a(2), a(3), ..., a(n-1), a(n) is divisible by n if and only if n is not a prime.
- a(n) = least k > 0 such that n-th partial sum is divisible by n if and only if n is not prime.A095248
a(n) = least k > 0 such that n-th partial sum is divisible by n if and only if n is not prime.
- Reverse concatenation of first n positive integers modulo forward concatenation of first n positive integers.A095249
Reverse concatenation of first n positive integers modulo forward concatenation of first n positive integers.
- a(n) = 11111111... (n times) = (10^n-1)/9 reduced mod n.A095250
a(n) = 11111111... (n times) = (10^n-1)/9 reduced mod n.
- Erroneous version of A038772.A095251
Erroneous version of A038772.
- a(n) = floor(sqrt{concatenation n,(n-1),...,3,2,1}).A095252
a(n) = floor(sqrt{concatenation n,(n-1),...,3,2,1}).
- a(n) = floor(concatenation(n,(n-1),...,3,2,1)^(1/n)).A095253
a(n) = floor(concatenation(n,(n-1),...,3,2,1)^(1/n)).
- a(n) = floor(concatenation(1,2,3,...,n-1,n)^(1/n)).A095254
a(n) = floor(concatenation(1,2,3,...,n-1,n)^(1/n)).
- a(n) = floor(10^n*log(n)).A095255
a(n) = floor(10^n*log(n)).
- Number of numbers not divisible by 10 that stay multiples of themselves when freed of their last n digits.A095256
Number of numbers not divisible by 10 that stay multiples of themselves when freed of their last n digits.
- Sum of three edges of box having both integral orthogonal sides and integral geodesic distances between opposite vertices.A095257
Sum of three edges of box having both integral orthogonal sides and integral geodesic distances between opposite vertices.
- a(n+1) is the smallest divisor of (2 + sum of first n terms) but not occurring earlier; a(1) = 1.A095258
a(n+1) is the smallest divisor of (2 + sum of first n terms) but not occurring earlier; a(1) = 1.
- Smallest m such that A095258(m) = n.A095259
Smallest m such that A095258(m) = n.
- a(n) = A095258(A095258(n)).A095260
a(n) = A095258(A095258(n)).