Sequences
392,541 sequences
- Initial prime of the first prime chain of length n under the iteration x->6x+5.A084961
Initial prime of the first prime chain of length n under the iteration x->6x+5.
- Iterations of the Fibonacci sequence starting at 6.A084962
Iterations of the Fibonacci sequence starting at 6.
- a(0) = 7, a(n+1) = Fibonacci(a(n)).A084963
a(0) = 7, a(n+1) = Fibonacci(a(n)).
- Follow n+2 by n. Also solution of a(n+2)=a(n)+1, a(0)=2, a(1)=0.A084964
Follow n+2 by n. Also solution of a(n+2)=a(n)+1, a(0)=2, a(1)=0.
- Number of labeled totally ordered semigroups with n elements.A084965
Number of labeled totally ordered semigroups with n elements.
- Minimum numbers of squares needed to write n! as a sum of nonzero squares.A084966
Minimum numbers of squares needed to write n! as a sum of nonzero squares.
- Multiples of 5 whose GCD with 6 is 1.A084967
Multiples of 5 whose GCD with 6 is 1.
- Multiples of 7 coprime to 30.A084968
Multiples of 7 coprime to 30.
- Numbers whose smallest prime factor is 11.A084969
Numbers whose smallest prime factor is 11.
- Numbers whose smallest prime factor is 13.A084970
Numbers whose smallest prime factor is 13.
- Determinant of the leading n X n submatrix of A083140.A084971
Determinant of the leading n X n submatrix of A083140.
- When A058033 first reaches n.A084972
When A058033 first reaches n.
- The maximum departure from the x axis, rounded to the nearest integer, in each cycle of the zeta function for increasingly larger negative values.A084973
The maximum departure from the x axis, rounded to the nearest integer, in each cycle of the zeta function for increasingly larger negative values.
- Primes that show the slow decrease in the larger values of the Andrica function Af(k) = sqrt(p(k+1)) - sqrt(p(k)), where p(k) denotes the k-th prime.A084974
Primes that show the slow decrease in the larger values of the Andrica function Af(k) = sqrt(p(k+1)) - sqrt(p(k)), where p(k) denotes the k-th prime.
- Primes that show the slow decrease in the larger values of the Andrica function Af(k) = sqrt(p(k+1)) - sqrt(p(k)), where p(k) denotes the k-th prime.A084975
Primes that show the slow decrease in the larger values of the Andrica function Af(k) = sqrt(p(k+1)) - sqrt(p(k)), where p(k) denotes the k-th prime.
- Values of k that show the slow decrease in the larger values of the Andrica function Af(k) = sqrt(p(k+1)) - sqrt(p(k)), where p(k) denotes the k-th prime.A084976
Values of k that show the slow decrease in the larger values of the Andrica function Af(k) = sqrt(p(k+1)) - sqrt(p(k)), where p(k) denotes the k-th prime.
- Values that show the slow decrease in the Andrica function Af(k) = sqrt(p(k+1)) - sqrt(p(k)), where p(k) denotes the k-th prime.A084977
Values that show the slow decrease in the Andrica function Af(k) = sqrt(p(k+1)) - sqrt(p(k)), where p(k) denotes the k-th prime.
- Number of ways to represent n as a+b*(c+d*(e+f*(...x+y*(z)...))) in positive integers.A084978
Number of ways to represent n as a+b*(c+d*(e+f*(...x+y*(z)...))) in positive integers.
- Palindromes such that the product of the digits + 1 is prime.A084979
Palindromes such that the product of the digits + 1 is prime.
- Triangle of (multi)factorials: n-th row is (n+1)!!... {n "!"s}, (n+1)!... {n-1 "!"s}, ..., (n+1)!.A084980
Triangle of (multi)factorials: n-th row is (n+1)!!... {n "!"s}, (n+1)!... {n-1 "!"s}, ..., (n+1)!.
- Numbers all of whose proper divisors are palindromic.A084981
Numbers all of whose proper divisors are palindromic.
- Erroneous version of A062687.A084982
Erroneous version of A062687.
- Palindromes made of only prime digits.A084983
Palindromes made of only prime digits.
- Numbers containing no prime digits.A084984
Numbers containing no prime digits.
- Palindromes in sequence A084984.A084985
Palindromes in sequence A084984.
- Duplicate of A034844.A084986
Duplicate of A034844.
- Duplicate of A083185.A084987
Duplicate of A083185.
- Numbers made with nonprime digits such that the sum of the digits is also not prime.A084988
Numbers made with nonprime digits such that the sum of the digits is also not prime.
- Number of 4-year terms served by n-th President of U.S.A.A084989
Number of 4-year terms served by n-th President of U.S.A.
- a(n) = n*(n^2+3*n-1)/3.A084990
a(n) = n*(n^2+3*n-1)/3.
- Palindromes which can be written as a sum of two prime numbers.A084991
Palindromes which can be written as a sum of two prime numbers.
- Palindromes such that the difference between the consecutive terms are palindromes and this has not been the difference of any two consecutive terms earlier.A084992
Palindromes such that the difference between the consecutive terms are palindromes and this has not been the difference of any two consecutive terms earlier.
- Total number of parts in all partitions of n into prime parts.A084993
Total number of parts in all partitions of n into prime parts.
- Duplicate of A046328.A084994
Duplicate of A046328.
- Numbers which can be written as the product of two different primes and the sum of digits is also prime.A084995
Numbers which can be written as the product of two different primes and the sum of digits is also prime.
- Numbers which can be written as the product of two distinct primes and containing only prime decimal digits.A084996
Numbers which can be written as the product of two distinct primes and containing only prime decimal digits.
- Numbers which can be written as the sum as well as the product of 2 primes, not necessarily the same.A084997
Numbers which can be written as the sum as well as the product of 2 primes, not necessarily the same.
- Palindromes formed from the concatenation of n, sum of n and R(n), and R(n) with its leading zeros; or 0 if no such palindrome exists. R(k) is the digit reversal of k.A084998
Palindromes formed from the concatenation of n, sum of n and R(n), and R(n) with its leading zeros; or 0 if no such palindrome exists. R(k) is the digit reversal of k.
- Determinant of a certain n X n matrix whose elements are the integers 1 to n^2.A084999
Determinant of a certain n X n matrix whose elements are the integers 1 to n^2.
- Maximal determinant of an n X n matrix using the integers 1 to n^2.A085000
Maximal determinant of an n X n matrix using the integers 1 to n^2.
- a(n) = (3*n+1)*(3*n+4).A085001
a(n) = (3*n+1)*(3*n+4).
- a(n) = floor(phi*n) - 2*floor(phi*n/2) where phi is the golden ratio.A085002
a(n) = floor(phi*n) - 2*floor(phi*n/2) where phi is the golden ratio.
- Partial sums of A085002.A085003
Partial sums of A085002.
- a(n)=2*A085003(n)-n.A085004
a(n)=2*A085003(n)-n.
- A Von Koch curve related to the Golden ratio.A085005
A Von Koch curve related to the Golden ratio.
- Let S(0)={1,1,2} S(n)={S(n-1), S(n-1)-{x},{3-x}} where x is the last element of S(n-1), then sequence is S(infinity).A085006
Let S(0)={1,1,2} S(n)={S(n-1), S(n-1)-{x},{3-x}} where x is the last element of S(n-1), then sequence is S(infinity).
- Partial sums of A085006.A085007
Partial sums of A085006.
- a(n)=9*A085007(n)-11*n.A085008
a(n)=9*A085007(n)-11*n.
- "Von Koch" sequence generated by {1,1,2}.A085009
"Von Koch" sequence generated by {1,1,2}.
- a(n)=2^(2^n)*sum(k=0,n,1/2^(2^k)).A085010
a(n)=2^(2^n)*sum(k=0,n,1/2^(2^k)).