Sequences
392,541 sequences
- Sequence is S(infinity), where S(1)={1,2,3}, S(n+1)=S(n)S'(n) and S'(n) is obtained from S(n) by changing last term using the cyclic permutation 1->2->3->1.A078711
Sequence is S(infinity), where S(1)={1,2,3}, S(n+1)=S(n)S'(n) and S'(n) is obtained from S(n) by changing last term using the cyclic permutation 1->2->3->1.
- Series expansion of (-3 - 2*x)/(1 + x - x^3) in powers of x.A078712
Series expansion of (-3 - 2*x)/(1 + x - x^3) in powers of x.
- Sum of squares of the distances between successive divisors of n.A078713
Sum of squares of the distances between successive divisors of n.
- a(n) = smallest number m which can be obtained in n ways by subtracting twice a triangular number from a perfect square.A078714
a(n) = smallest number m which can be obtained in n ways by subtracting twice a triangular number from a perfect square.
- Palindromic Roman numerals.A078715
Palindromic Roman numerals.
- Sequence has period 9 and differences between successive terms are 4, -3, 4, -3, 4, -3, 4, -3, -4.A078716
Sequence has period 9 and differences between successive terms are 4, -3, 4, -3, 4, -3, 4, -3, -4.
- Number of n-step self-avoiding walks on cubic lattice with first step specified.A078717
Number of n-step self-avoiding walks on cubic lattice with first step specified.
- a(n) = (-1)^n*(2*n - 1)*CatalanNumber(n - 2) for n >= 2, a(n) = n for n = 0, 1.A078718
a(n) = (-1)^n*(2*n - 1)*CatalanNumber(n - 2) for n >= 2, a(n) = n for n = 0, 1.
- Number of odd terms among n, f(n), f(f(n)), ...., 1 for the Collatz function (that is, until reaching "1" for the first time), or -1 if 1 is never reached.A078719
Number of odd terms among n, f(n), f(f(n)), ...., 1 for the Collatz function (that is, until reaching "1" for the first time), or -1 if 1 is never reached.
- Integer part of the ratio of even to odd terms among n, f(n), f(f(n)), ...., 1 for the Collatz function (that is, until reaching "1" for the first time), or -1 if 1 is never reached.A078720
Integer part of the ratio of even to odd terms among n, f(n), f(f(n)), ...., 1 for the Collatz function (that is, until reaching "1" for the first time), or -1 if 1 is never reached.
- a(n) = prime(n*(n+1)/2 + 1).A078721
a(n) = prime(n*(n+1)/2 + 1).
- a(n) = prime(n*(n+1)/2+2).A078722
a(n) = prime(n*(n+1)/2+2).
- a(n) = prime(n*(n+1)/2 + n).A078723
a(n) = prime(n*(n+1)/2 + n).
- a(n) = prime(n*(n+1)/2+3).A078724
a(n) = prime(n*(n+1)/2+3).
- a(n) = prime(n*(n+1)/2+4).A078725
a(n) = prime(n*(n+1)/2+4).
- Fermat numbers 2^(2^n) + 1 with digits sorted in increasing order and zeros suppressed.A078726
Fermat numbers 2^(2^n) + 1 with digits sorted in increasing order and zeros suppressed.
- Smallest prime a(n) > a(n-1) such that a(1) + ... + a(n) is a Fibonacci number.A078727
Smallest prime a(n) > a(n-1) such that a(1) + ... + a(n) is a Fibonacci number.
- a(n) is the smallest m such that m < 10^n, 10^n + m is prime and if the natural number k is such that 1 < k < 10 and 3 doesn't divide k*10^n + m then k*10^n+m is prime.A078728
a(n) is the smallest m such that m < 10^n, 10^n + m is prime and if the natural number k is such that 1 < k < 10 and 3 doesn't divide k*10^n + m then k*10^n+m is prime.
- a(n) = the least positive integer k such that (k+1)*(k+2)*...*(k+n) + 1 is prime, if such k exists; otherwise, = 0.A078729
a(n) = the least positive integer k such that (k+1)*(k+2)*...*(k+n) + 1 is prime, if such k exists; otherwise, = 0.
- Sum of products of two successive divisors of n.A078730
Sum of products of two successive divisors of n.
- Sum of primes between successive pairs of twin primes.A078731
Sum of primes between successive pairs of twin primes.
- Numbers k such that the b1(k)^2=b0(k) where b1(k) denotes the number of 1's in binary expansion of k, b0(k) the number of 0's.A078732
Numbers k such that the b1(k)^2=b0(k) where b1(k) denotes the number of 1's in binary expansion of k, b0(k) the number of 0's.
- Numbers k such that the b0(k)^2=b1(k) where b1(k) denotes the number of 1's in binary expansion of k, b0(k) the number of 0's.A078733
Numbers k such that the b0(k)^2=b1(k) where b1(k) denotes the number of 1's in binary expansion of k, b0(k) the number of 0's.
- Start with 1,2, concatenate 2^k previous terms and change last term as follows: 1->2, 2->3, 3->1.A078734
Start with 1,2, concatenate 2^k previous terms and change last term as follows: 1->2, 2->3, 3->1.
- a(0) = 0, a(1) = 3; a(n+1) = the smallest x such that Fibonacci(x)-Fibonacci(a(n)) is both prime and greater than Fibonacci(a(n))-Fibonacci(a(n-1)).A078735
a(0) = 0, a(1) = 3; a(n+1) = the smallest x such that Fibonacci(x)-Fibonacci(a(n)) is both prime and greater than Fibonacci(a(n))-Fibonacci(a(n-1)).
- Numerators of convergents to sqrt(e).A078736
Numerators of convergents to sqrt(e).
- Denominators of convergents to sqrt(e).A078737
Denominators of convergents to sqrt(e).
- Generalized Bell numbers B_{3,2}(n).A078738
Generalized Bell numbers B_{3,2}(n).
- Triangle of generalized Stirling numbers S_{2,2}(n,k) read by rows (n>=1, 2<=k<=2n).A078739
Triangle of generalized Stirling numbers S_{2,2}(n,k) read by rows (n>=1, 2<=k<=2n).
- Triangle of generalized Stirling numbers S_{3,2}(n,k) read by rows (n>=1, 2<=k<=2n).A078740
Triangle of generalized Stirling numbers S_{3,2}(n,k) read by rows (n>=1, 2<=k<=2n).
- Triangle of generalized Stirling numbers S_{3,3}(n,k) read by rows (n>=1, 3<=k<=3n).A078741
Triangle of generalized Stirling numbers S_{3,3}(n,k) read by rows (n>=1, 3<=k<=3n).
- a(n) = smallest Fibonacci number > a(n-1) such that a(1) + ... + a(n) is prime.A078742
a(n) = smallest Fibonacci number > a(n-1) such that a(1) + ... + a(n) is prime.
- a(n) is the Fibonacci index of b(n) in the sequence b(1), b(2), ... where b(n) is the smallest Fibonacci number > b(n-1) such that b(1) + ... + b(n) is prime.A078743
a(n) is the Fibonacci index of b(n) in the sequence b(1), b(2), ... where b(n) is the smallest Fibonacci number > b(n-1) such that b(1) + ... + b(n) is prime.
- Numbers k such that A049614(k) + A000040(k) is prime.A078744
Numbers k such that A049614(k) + A000040(k) is prime.
- Numbers k such that A049614(k) - A000040(k) is prime.A078745
Numbers k such that A049614(k) - A000040(k) is prime.
- a(n) = prime(2*n*(n+1)+1).A078746
a(n) = prime(2*n*(n+1)+1).
- Expansion of Sum_{k>0} k*phi(k)*x^k/(1+x^k).A078747
Expansion of Sum_{k>0} k*phi(k)*x^k/(1+x^k).
- Duplicate of A051131.A078748
Duplicate of A051131.
- Duplicate of A051130.A078749
Duplicate of A051130.
- Least m not less than 2*n such that m + n = m OR n (logical 'or', bitwise).A078750
Least m not less than 2*n such that m + n = m OR n (logical 'or', bitwise).
- Triangle read by rows: T(m,k) = normalized partial derivative of (t,z) -> exp(t*g(z)) at (0,0), where 2*g(z) = 1 + exp(-2*z*g(z)).A078751
Triangle read by rows: T(m,k) = normalized partial derivative of (t,z) -> exp(t*g(z)) at (0,0), where 2*g(z) = 1 + exp(-2*z*g(z)).
- Least m>n such that phi(m) >= 2*phi(n), where phi is Euler's totient function (A000010).A078752
Least m>n such that phi(m) >= 2*phi(n), where phi is Euler's totient function (A000010).
- Number of steps to factor 2n+1 using Fermat's factorization method.A078753
Number of steps to factor 2n+1 using Fermat's factorization method.
- Numbers k such that for all m>k there are more than n primes between m and 2m (inclusive).A078754
Numbers k such that for all m>k there are more than n primes between m and 2m (inclusive).
- Values of n such that equal numbers of 0's and 1's occur in the first n terms of the repetition-resistant sequence A079101.A078755
Values of n such that equal numbers of 0's and 1's occur in the first n terms of the repetition-resistant sequence A079101.
- Decimal expansion of -x, where x is the unique nonzero real solution to Sum_{p prime} x^p = 0.A078756
Decimal expansion of -x, where x is the unique nonzero real solution to Sum_{p prime} x^p = 0.
- Values of A028470(n)/A000045(n+1).A078757
Values of A028470(n)/A000045(n+1).
- Term in A064389 (variation (4) of Recamán's sequence) where n appears, or 0 if n never appears.A078758
Term in A064389 (variation (4) of Recamán's sequence) where n appears, or 0 if n never appears.
- Height of n-th term in A064389 (variation (4) of Recamán's sequence).A078759
Height of n-th term in A064389 (variation (4) of Recamán's sequence).
- Combinations of a partition: number of ways to label a partition (of size n) with numbers 1 to n.A078760
Combinations of a partition: number of ways to label a partition (of size n) with numbers 1 to n.