Sequences
392,541 sequences
- a(n) = gcd(prime(n)-1,n-1).A084311
a(n) = gcd(prime(n)-1,n-1).
- Duplicate of A066752.A084312
Duplicate of A066752.
- a(n)=x is the smallest number such that gcd(prime(x)-1, x) = n.A084313
a(n)=x is the smallest number such that gcd(prime(x)-1, x) = n.
- a(n) = x is the smallest number such that gcd(prime(x)+1, x) = n.A084314
a(n) = x is the smallest number such that gcd(prime(x)+1, x) = n.
- a(n) = x is the smallest number such that gcd(prime(x)-1,x-1) = n.A084315
a(n) = x is the smallest number such that gcd(prime(x)-1,x-1) = n.
- a(n) is the smallest number x such that gcd(prime(x)+1,x+1) = n.A084316
a(n) is the smallest number x such that gcd(prime(x)+1,x+1) = n.
- Concatenation of the prime factors of n, in increasing order.A084317
Concatenation of the prime factors of n, in increasing order.
- Iterate function described in A084317 if started at initial value n until reaching a fixed point.A084318
Iterate function described in A084317 if started at initial value n until reaching a fixed point.
- Orbit of 91 under function described in A084317.A084319
Orbit of 91 under function described in A084317.
- Number of powers of two between 2 consecutive factorials (2! including).A084320
Number of powers of two between 2 consecutive factorials (2! including).
- Least number k such that between k! and (k+1)! there are n powers of 2 (each interval includes (k+1)! but not k!).A084321
Least number k such that between k! and (k+1)! there are n powers of 2 (each interval includes (k+1)! but not k!).
- Fixed points if prime-factor-concatenation function (A084318) is iterated at primorial number initial values.A084322
Fixed points if prime-factor-concatenation function (A084318) is iterated at primorial number initial values.
- Fixed points reached when prime-factor-concatenation function [A084317] is started at n!.A084323
Fixed points reached when prime-factor-concatenation function [A084317] is started at n!.
- Palindromic numbers that set a new record for number of palindromic divisors.A084324
Palindromic numbers that set a new record for number of palindromic divisors.
- Palindromes such that at least one divisor is non-palindromic; palindromes not in A062687.A084325
Palindromes such that at least one divisor is non-palindromic; palindromes not in A062687.
- a(0)=0, a(1)=1; for n>1, a(n) = 6*a(n-1)-4*a(n-2).A084326
a(0)=0, a(1)=1; for n>1, a(n) = 6*a(n-1)-4*a(n-2).
- Duplicate of A057085.A084327
Duplicate of A057085.
- a(0)=0, a(1)=1; a(n) = 13*a(n-1) - 11*a(n-2).A084328
a(0)=0, a(1)=1; a(n) = 13*a(n-1) - 11*a(n-2).
- a(0)=0, a(1)=1, a(n)=20a(n-1)-20a(n-2).A084329
a(0)=0, a(1)=1, a(n)=20a(n-1)-20a(n-2).
- a(0)=0, a(1)=1, a(n) = 31*a(n-1) - 29*a(n-2).A084330
a(0)=0, a(1)=1, a(n) = 31*a(n-1) - 29*a(n-2).
- a(1) = 2; a(n+1) is the least prime p not already used such that |p-a(n)| is not equal to |a(k+1)-a(k)| for any k < n.A084331
a(1) = 2; a(n+1) is the least prime p not already used such that |p-a(n)| is not equal to |a(k+1)-a(k)| for any k < n.
- Duplicate of A081145.A084332
Duplicate of A081145.
- Erroneous version of A084331.A084333
Erroneous version of A084331.
- a(1) = 1; a(n+1) is the least squarefree m not already used such that |m-a(n)| is not equal to |a(k+1)-a(k)| for any k < n.A084334
a(1) = 1; a(n+1) is the least squarefree m not already used such that |m-a(n)| is not equal to |a(k+1)-a(k)| for any k < n.
- a(1) = 1; a(n+1) is the least composite number m not already used such that |m-a(n)| is not equal to |a(k+1)-a(k)| for any k < n.A084335
a(1) = 1; a(n+1) is the least composite number m not already used such that |m-a(n)| is not equal to |a(k+1)-a(k)| for any k < n.
- a(n) is the smallest composite number not already in the sequence such that the absolute values of the successive differences are distinct primes.A084336
a(n) is the smallest composite number not already in the sequence such that the absolute values of the successive differences are distinct primes.
- Rearrangement of positive integers so that the successive ratios (of the larger to the smaller term) are all distinct integers. a(m)/a(m-1) = a(k)/a(k-1) iff m = k (assuming a(m) > a(m-1), otherwise the ratio a(m-1)/a(m) is to be considered). Priority is given to smallest number not included earlier rather than to the successive ratio that has not occurred earlier.A084337
Rearrangement of positive integers so that the successive ratios (of the larger to the smaller term) are all distinct integers. a(m)/a(m-1) = a(k)/a(k-1) iff m = k (assuming a(m) > a(m-1), otherwise the ratio a(m-1)/a(m) is to be considered). Priority is given to smallest number not included earlier rather than to the successive ratio that has not occurred earlier.
- a(1) = 1, a(2) = 2, a(3) = 3, a(n+3) = a(n) + a(n+1).A084338
a(1) = 1, a(2) = 2, a(3) = 3, a(n+3) = a(n) + a(n+1).
- 7*n digit-reversed mod 7.A084339
7*n digit-reversed mod 7.
- 8*n digit-reversed mod 8.A084340
8*n digit-reversed mod 8.
- 13*n digit-reversed mod 13.A084341
13*n digit-reversed mod 13.
- Digit reversal of n concatenated with n mod n.A084342
Digit reversal of n concatenated with n mod n.
- Duplicate of A083907.A084343
Duplicate of A083907.
- A077982(n) >= 5.A084344
A077982(n) >= 5.
- Numbers with a nonprime number of 1's in their binary expansion (complement of A052294).A084345
Numbers with a nonprime number of 1's in their binary expansion (complement of A052294).
- Triangle read by rows in which row n gives decomposition of Fib(n)*Fib(n+1) into non-adjacent Fibonacci numbers (given by their indices).A084346
Triangle read by rows in which row n gives decomposition of Fib(n)*Fib(n+1) into non-adjacent Fibonacci numbers (given by their indices).
- Duplicate of A084034.A084347
Duplicate of A084034.
- Triangle in which row n gives periodic part of a certain map.A084348
Triangle in which row n gives periodic part of a certain map.
- Squarefree numbers that are not the sum of two squares.A084349
Squarefree numbers that are not the sum of two squares.
- Palindromic brilliant numbers.A084350
Palindromic brilliant numbers.
- Length of period of sequences r(k,n)=floor(sin(1)*k!)-n*floor(sin(1)*k!/n) when n is fixed.A084351
Length of period of sequences r(k,n)=floor(sin(1)*k!)-n*floor(sin(1)*k!/n) when n is fixed.
- Minimum digit out of both prime factors of palindromic brilliant numbers.A084352
Minimum digit out of both prime factors of palindromic brilliant numbers.
- Palindromes such that the product of the nonzero digits + 1 is prime.A084353
Palindromes such that the product of the nonzero digits + 1 is prime.
- Primes whose product of nonzero digits + 1 is prime.A084354
Primes whose product of nonzero digits + 1 is prime.
- Least number of positive cubes needed to represent n!.A084355
Least number of positive cubes needed to represent n!.
- A000055(n+2)-A023359(n).A084356
A000055(n+2)-A023359(n).
- Number of sets of sets of lists.A084357
Number of sets of sets of lists.
- Lists of sets of lists.A084358
Lists of sets of lists.
- a(n) = number of partitions of n into pair of parts n=p+q, p>=q>=1, with p-q equal to a square >= 0.A084359
a(n) = number of partitions of n into pair of parts n=p+q, p>=q>=1, with p-q equal to a square >= 0.
- Number of partitions of n into pair of parts whose difference is a prime.A084360
Number of partitions of n into pair of parts whose difference is a prime.