Sequences
392,541 sequences
- a(n) = abs(prime(n)-a(n-1)) + abs(prime(n)-a(n-2)).A086911
a(n) = abs(prime(n)-a(n-1)) + abs(prime(n)-a(n-2)).
- a(n) = prime(a(n-1)) + abs(prime(n)-a(n-1)).A086912
a(n) = prime(a(n-1)) + abs(prime(n)-a(n-1)).
- a(n) = prime(a(n-2)) + abs(prime(n) - a(n-2)) with a(1)=a(2)=1.A086913
a(n) = prime(a(n-2)) + abs(prime(n) - a(n-2)) with a(1)=a(2)=1.
- a(n) = ((n-1)^n/n)*Sum_{k>=1} (k^n/n^k).A086914
a(n) = ((n-1)^n/n)*Sum_{k>=1} (k^n/n^k).
- Triangle read by rows: T(n,k) = 2^k * (n!/k!)*binomial(n-1,k-1).A086915
Triangle read by rows: T(n,k) = 2^k * (n!/k!)*binomial(n-1,k-1).
- Number of digits in terms of A087732.A086916
Number of digits in terms of A087732.
- a(n) = floor(prime(n) - n*(log(n) - log(log(n)) - 1)) for n>=2.A086917
a(n) = floor(prime(n) - n*(log(n) - log(log(n)) - 1)) for n>=2.
- Numbers with at least three digits such that the absolute differences between successive digits forms a palindrome (when leading zeros are omitted).A086918
Numbers with at least three digits such that the absolute differences between successive digits forms a palindrome (when leading zeros are omitted).
- Smallest number whose absolute value of the successive digit difference is the n-th palindrome, or -1 if no such number exists.A086919
Smallest number whose absolute value of the successive digit difference is the n-th palindrome, or -1 if no such number exists.
- Smallest k such that n times concatenation of k with itself followed by a 1 is a prime, or 0 if no such number exists.A086920
Smallest k such that n times concatenation of k with itself followed by a 1 is a prime, or 0 if no such number exists.
- Least number with at least n divisors that are at most its square root.A086921
Least number with at least n divisors that are at most its square root.
- Number of idempotent n X n (0,1) matrices over the reals.A086922
Number of idempotent n X n (0,1) matrices over the reals.
- Primes arising in A086920, or 0 if A086920(n) = 0.A086923
Primes arising in A086920, or 0 if A086920(n) = 0.
- Primes such that sum of the first and last digits is a square.A086924
Primes such that sum of the first and last digits is a square.
- a(1) = 1; a(n+1) = a(n)/spf(a(n)) + number of earlier occurrences of a(n), spf=A020639 = smallest prime factor.A086925
a(1) = 1; a(n+1) = a(n)/spf(a(n)) + number of earlier occurrences of a(n), spf=A020639 = smallest prime factor.
- Product of Fibonacci and (shifted) triangular numbers.A086926
Product of Fibonacci and (shifted) triangular numbers.
- a(n) = 10*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 10.A086927
a(n) = 10*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 10.
- a(n) = 12*a(n-1) + a(n-2), with a(0) = 2 and a(1) = 12.A086928
a(n) = 12*a(n-1) + a(n-2), with a(0) = 2 and a(1) = 12.
- a(1) = 1, a(n) = n times (the digit reversal of the (n-1)-th partial sum).A086929
a(1) = 1, a(n) = n times (the digit reversal of the (n-1)-th partial sum).
- Smallest b>1 such that in base b representation the n-th prime is a repunit.A086930
Smallest b>1 such that in base b representation the n-th prime is a repunit.
- a(0) = 1, a(n) = spf(n)*a(n-spf(n)), where spf=A020639 (smallest prime factor).A086931
a(0) = 1, a(n) = spf(n)*a(n-spf(n)), where spf=A020639 (smallest prime factor).
- Number of non-congruent solutions of x^2 + y^2 == -1 (mod n).A086932
Number of non-congruent solutions of x^2 + y^2 == -1 (mod n).
- Number of solutions to x^2 + y^2 = 0 mod n.A086933
Number of solutions to x^2 + y^2 = 0 mod n.
- E.g.f.: (sqrt(Pi)/2)*erf(log(1-x)).A086934
E.g.f.: (sqrt(Pi)/2)*erf(log(1-x)).
- a(n) is the smallest square such that n occurs in its decimal representation.A086935
a(n) is the smallest square such that n occurs in its decimal representation.
- Number of primes between n and p(n) inclusive.A086936
Number of primes between n and p(n) inclusive.
- Number of distinct zeros of x^2-x-1 mod prime(n).A086937
Number of distinct zeros of x^2-x-1 mod prime(n).
- Smallest m with A086571(m) = n.A086938
Smallest m with A086571(m) = n.
- Greatest m with A086571(m) = n.A086939
Greatest m with A086571(m) = n.
- a(n) = k where R(k+4) = 2.A086940
a(n) = k where R(k+4) = 2.
- a(n) = k where R(k+6) = 3.A086941
a(n) = k where R(k+6) = 3.
- Integers k such that R(k+8) = 4.A086942
Integers k such that R(k+8) = 4.
- Integers k such that R(k+7) = 3.A086943
Integers k such that R(k+7) = 3.
- a(n) = k where R(k+8) = 5.A086944
a(n) = k where R(k+8) = 5.
- a(n) = 7*10^n - 9.A086945
a(n) = 7*10^n - 9.
- Numbers k such that R(k+6) = 2.A086946
Numbers k such that R(k+6) = 2.
- Numbers k such that R(k+9) = 3.A086947
Numbers k such that R(k+9) = 3.
- a(n) = k where R(k+8) = 2.A086948
a(n) = k where R(k+8) = 2.
- Numbers k such that R(k+9) = 5.A086949
Numbers k such that R(k+9) = 5.
- Binomial transform of decagonal numbers A001107.A086950
Binomial transform of decagonal numbers A001107.
- a(n) = n*3^n*(4*n - 1)/9.A086951
a(n) = n*3^n*(4*n - 1)/9.
- a(n) = n^2*4^n/4.A086952
a(n) = n^2*4^n/4.
- Binomial transform of (-1)^mod(n,3) (A257075).A086953
Binomial transform of (-1)^mod(n,3) (A257075).
- Binomial transform of A061800.A086954
Binomial transform of A061800.
- a(n) = n^2 + 2*n + 2 - (-1)^n.A086955
a(n) = n^2 + 2*n + 2 - (-1)^n.
- a(1)=1, for n>1: a(n) is the smallest divisor of n occurring earlier at most twice.A086956
a(1)=1, for n>1: a(n) is the smallest divisor of n occurring earlier at most twice.
- Smallest m with A086956(m)=n.A086957
Smallest m with A086956(m)=n.
- m such that A086956(m)=n and A086956(k)=n for exactly one k<m (k=A086957(n)).A086958
m such that A086956(m)=n and A086956(k)=n for exactly one k<m (k=A086957(n)).
- Greatest m with A086956(m)=n.A086959
Greatest m with A086956(m)=n.
- a(A086957(n))=A086958(n), a(A086958(n))=A086959(n), a(A086959(n))=A086957(n), see A086956.A086960
a(A086957(n))=A086958(n), a(A086958(n))=A086959(n), a(A086959(n))=A086957(n), see A086956.