Sequences
392,541 sequences
- a(1)=2; a(n>1)= greatest prime divisor of {a(n-1) + n}.A076561
a(1)=2; a(n>1)= greatest prime divisor of {a(n-1) + n}.
- a(1)=3; a(n>1)= greatest prime divisor of a(n-1) + n.A076562
a(1)=3; a(n>1)= greatest prime divisor of a(n-1) + n.
- a(n) = n - greatest prime divisor of n, for n>1.A076563
a(n) = n - greatest prime divisor of n, for n>1.
- List of numbers k such that the k-th Fibonacci number (A000045) does not contain the digit zero.A076564
List of numbers k such that the k-th Fibonacci number (A000045) does not contain the digit zero.
- Greatest prime divisor of 2n+1 (sum of two successive integers).A076565
Greatest prime divisor of 2n+1 (sum of two successive integers).
- Greatest prime divisor of 3n+3 (sum of three successive integers).A076566
Greatest prime divisor of 3n+3 (sum of three successive integers).
- Greatest prime divisor of 4n+6 (sum of four successive integers).A076567
Greatest prime divisor of 4n+6 (sum of four successive integers).
- Greatest prime divisor of 5n+10 (sum of five successive integers).A076568
Greatest prime divisor of 5n+10 (sum of five successive integers).
- Greatest prime divisor of 6n+15 (sum of six successive integers).A076569
Greatest prime divisor of 6n+15 (sum of six successive integers).
- Greatest prime divisor of sum of first n primes.A076570
Greatest prime divisor of sum of first n primes.
- Binomial triangle based on factorials.A076571
Binomial triangle based on factorials.
- a(0)=1 if n>0 a(n)=(-1)^(n+1)/(2n+1) * Sum_{k=0..n} 4^(4k)*B(2k)*C(2n+1,2k) where B(k) denotes the k-th Bernoulli number.A076572
a(0)=1 if n>0 a(n)=(-1)^(n+1)/(2n+1) * Sum_{k=0..n} 4^(4k)*B(2k)*C(2n+1,2k) where B(k) denotes the k-th Bernoulli number.
- a(0)=1 if n>0 a(n)=(-1)^(n+1)/(2n+1) * Sum_{k=0..n} 4^(5k)*B(2k)*C(2n+1,2k) where B(k) denotes the k-th Bernoulli number.A076573
a(0)=1 if n>0 a(n)=(-1)^(n+1)/(2n+1) * Sum_{k=0..n} 4^(5k)*B(2k)*C(2n+1,2k) where B(k) denotes the k-th Bernoulli number.
- a(0)=1 if n>0 a(n)=((-1)^(n+1)/(2*n+1)) * Sum_{k=0..n} 4^(6*k)*B(2*k)*C(2*n+1,2*k) where B(k) denotes the k-th Bernoulli number.A076574
a(0)=1 if n>0 a(n)=((-1)^(n+1)/(2*n+1)) * Sum_{k=0..n} 4^(6*k)*B(2*k)*C(2*n+1,2*k) where B(k) denotes the k-th Bernoulli number.
- a(0)=1 if n>0 a(n)=(-1)^(n+1)/(2n+1) * Sum_{k=0..n} 4^(7k)*B(2k)*C(2n+1,2k) where B(k) denotes the k-th Bernoulli number.A076575
a(0)=1 if n>0 a(n)=(-1)^(n+1)/(2n+1) * Sum_{k=0..n} 4^(7k)*B(2k)*C(2n+1,2k) where B(k) denotes the k-th Bernoulli number.
- Erroneous version of A084255.A076576
Erroneous version of A084255.
- Sum of squares of divisors d of n such that n/d is odd.A076577
Sum of squares of divisors d of n such that n/d is odd.
- Triangular numbers which are 4-almost primes.A076578
Triangular numbers which are 4-almost primes.
- Triangular numbers which are 5-almost primes.A076579
Triangular numbers which are 5-almost primes.
- Triangular numbers which are 6-almost primes.A076580
Triangular numbers which are 6-almost primes.
- Triangular numbers which are 7-almost primes.A076581
Triangular numbers which are 7-almost primes.
- Triangular numbers which are 8-almost primes.A076582
Triangular numbers which are 8-almost primes.
- Triangular numbers which are 9-almost primes.A076583
Triangular numbers which are 9-almost primes.
- Let P(n,x) = Product_{k=1..n} polcyclo(k,x) where polcyclo(k,x) denotes the k-th cyclotomic polynomial. Sequence gives the maximum value of coefficients of P(n,x).A076584
Let P(n,x) = Product_{k=1..n} polcyclo(k,x) where polcyclo(k,x) denotes the k-th cyclotomic polynomial. Sequence gives the maximum value of coefficients of P(n,x).
- Let P(n,x) = Product_{k=1..n} polcyclo(k,x) where polcyclo(k,x) denotes the k-th cyclotomic polynomial. Sequence gives array of coefficients of P(n,x).A076585
Let P(n,x) = Product_{k=1..n} polcyclo(k,x) where polcyclo(k,x) denotes the k-th cyclotomic polynomial. Sequence gives array of coefficients of P(n,x).
- Total number of right truncatable primes in base n.A076586
Total number of right truncatable primes in base n.
- First occurrence of n as a term in the continued fraction for Pi/2.A076587
First occurrence of n as a term in the continued fraction for Pi/2.
- First occurrence of n as a term in the continued fraction for Pi/4.A076588
First occurrence of n as a term in the continued fraction for Pi/4.
- First occurrence of n as a term in the continued fraction for sqrt(Pi).A076589
First occurrence of n as a term in the continued fraction for sqrt(Pi).
- First occurrence of n as a term in the continued fraction for zeta(2)=Pi^2/6.A076590
First occurrence of n as a term in the continued fraction for zeta(2)=Pi^2/6.
- a(1)=1, a(2)=2 a(n)=a(n-1)+(a(n-2) mod n).A076591
a(1)=1, a(2)=2 a(n)=a(n-1)+(a(n-2) mod n).
- First occurrence of n as a term in the continued fraction for log(2).A076592
First occurrence of n as a term in the continued fraction for log(2).
- First occurrence of n as a term in the continued fraction for log(3).A076593
First occurrence of n as a term in the continued fraction for log(3).
- First occurrence of n as a term in the continued fraction for log(5).A076594
First occurrence of n as a term in the continued fraction for log(5).
- First occurrence of n as a term in the continued fraction for the cube root of 2.A076595
First occurrence of n as a term in the continued fraction for the cube root of 2.
- Triangle read by rows: n-th row contains n numbers whose product is a square; all numbers in the triangle are distinct and the square is as small as possible.A076596
Triangle read by rows: n-th row contains n numbers whose product is a square; all numbers in the triangle are distinct and the square is as small as possible.
- Numbers k such that sqrt(k*(k-1)*(k-2)*(k-3)+1) is a prime.A076597
Numbers k such that sqrt(k*(k-1)*(k-2)*(k-3)+1) is a prime.
- Sum of squares of divisors d of n such that d or n/d is odd.A076598
Sum of squares of divisors d of n such that d or n/d is odd.
- Numbers n such that A068340(n) = +-10.A076599
Numbers n such that A068340(n) = +-10.
- a(n) = smallest k > n such that n^2 + k^2 is a square, or 0 if no such k exists.A076600
a(n) = smallest k > n such that n^2 + k^2 is a square, or 0 if no such k exists.
- a(1)=3, a(n_even)=(a(n-1)^2-1)/2; a(n_odd)=a(n-1)+1.A076601
a(1)=3, a(n_even)=(a(n-1)^2-1)/2; a(n_odd)=a(n-1)+1.
- a(1)=7, a(n_even)=(a(n-1)^2-1)/2; a(n_odd)=a(n-1)+1.A076602
a(1)=7, a(n_even)=(a(n-1)^2-1)/2; a(n_odd)=a(n-1)+1.
- a(1)=9, a(n_even)=(a(n-1)^2-1)/2; a(n_odd)=a(n-1)+1.A076603
a(1)=9, a(n_even)=(a(n-1)^2-1)/2; a(n_odd)=a(n-1)+1.
- a(1) = 11, a(n_even) = (a(n-1)^2-1)/2; a(n_odd) = a(n-1)+1.A076604
a(1) = 11, a(n_even) = (a(n-1)^2-1)/2; a(n_odd) = a(n-1)+1.
- Largest prime divisor of n^2 - 1.A076605
Largest prime divisor of n^2 - 1.
- Min { largest prime factor of n-1, largest prime factor of n+1 }.A076606
Min { largest prime factor of n-1, largest prime factor of n+1 }.
- a(0)=1 and for n>0: a(n) = if gcd(a(n-1),n)>1 then lcm(a(n-1),n) else a(n-1)+n.A076607
a(0)=1 and for n>0: a(n) = if gcd(a(n-1),n)>1 then lcm(a(n-1),n) else a(n-1)+n.
- Number of nonprimes k < n such that also n-k is not a prime.A076608
Number of nonprimes k < n such that also n-k is not a prime.
- Palindromic numbers with prime middle digit.A076609
Palindromic numbers with prime middle digit.
- Numbers having only prime factors of form prime(prime); a(1)=1.A076610
Numbers having only prime factors of form prime(prime); a(1)=1.