Sequences
392,541 sequences
- a(1)=1, a(n)=3*a(n-1) if n is not a multiple of 3, or a(n)=a(n/3)+1 if n is a multiple of 3.A082561
a(1)=1, a(n)=3*a(n-1) if n is not a multiple of 3, or a(n)=a(n/3)+1 if n is a multiple of 3.
- a(n) = number of values of m such that m can be expressed as the sum of distinct odd numbers with largest odd number in the sum = 2n+1.A082562
a(n) = number of values of m such that m can be expressed as the sum of distinct odd numbers with largest odd number in the sum = 2n+1.
- a(1) = 3; for n>=1, a(n+1) is the smallest palindromic prime with a(n) as a central substring.A082563
a(1) = 3; for n>=1, a(n+1) is the smallest palindromic prime with a(n) as a central substring.
- Expansion of eta(q)^2 * eta(q^2) / eta(q^4) in powers of q.A082564
Expansion of eta(q)^2 * eta(q^2) / eta(q^4) in powers of q.
- Palindromic primes associated with A082520.A082565
Palindromic primes associated with A082520.
- Primes p such that p, 2p+1, 4p+3 are palindromic primes.A082566
Primes p such that p, 2p+1, 4p+3 are palindromic primes.
- Palindromic time display in hours, minutes, seconds on a six spaced 24-hour digital clock, using hours 1-24.A082567
Palindromic time display in hours, minutes, seconds on a six spaced 24-hour digital clock, using hours 1-24.
- First nontrivial square root of unity mod A033949(n); i.e., smallest x > 1 such that x^2 == 1 mod A033949(n).A082568
First nontrivial square root of unity mod A033949(n); i.e., smallest x > 1 such that x^2 == 1 mod A033949(n).
- a(1)=2; a(n)=ceiling(n*(a(n-1)-1/a(n-1))).A082569
a(1)=2; a(n)=ceiling(n*(a(n-1)-1/a(n-1))).
- a(1)=1, a(n)=ceiling(n*(a(n-1)+1/a(n-1))).A082570
a(1)=1, a(n)=ceiling(n*(a(n-1)+1/a(n-1))).
- Continued fraction expansion of common logarithm of 7 = log_10 7.A082571
Continued fraction expansion of common logarithm of 7 = log_10 7.
- a(n) is the least number m such that the arithmetic mean of the distinct primes dividing m equals n.A082572
a(n) is the least number m such that the arithmetic mean of the distinct primes dividing m equals n.
- a(1)=1, a(n)=ceiling(n*(a(n-1)+3/a(n-1))).A082573
a(1)=1, a(n)=ceiling(n*(a(n-1)+3/a(n-1))).
- a(1)=1, a(n) = ceiling(r(3)*a(n-1)) where r(3) = (1/2)*(3 + sqrt(13)) is the positive root of X^2 = 3*X + 1.A082574
a(1)=1, a(n) = ceiling(r(3)*a(n-1)) where r(3) = (1/2)*(3 + sqrt(13)) is the positive root of X^2 = 3*X + 1.
- Nonnegative numbers in (3*A005836) union (3*A005836 - 2) [A005836 lists the numbers with base-3 representation containing no 2].A082575
Nonnegative numbers in (3*A005836) union (3*A005836 - 2) [A005836 lists the numbers with base-3 representation containing no 2].
- Numbers k such that k^k has final digits the same as all the digits of k.A082576
Numbers k such that k^k has final digits the same as all the digits of k.
- a(n) = first digit to the right of decimal point of n*(sqrt(5)-1)/2.A082577
a(n) = first digit to the right of decimal point of n*(sqrt(5)-1)/2.
- a(n) = Sum_{k=0..n} binomial(2*k, k) * binomial(2*k+1,k).A082578
a(n) = Sum_{k=0..n} binomial(2*k, k) * binomial(2*k+1,k).
- Expansion of e.g.f.: exp( x/(1-x)^2 ).A082579
Expansion of e.g.f.: exp( x/(1-x)^2 ).
- A sum of Lah numbers and binomial coefficients.A082580
A sum of Lah numbers and binomial coefficients.
- Binomial coefficients C(p, k), 2<=k<=p-2, sorted, with duplicates removed, p being prime.A082581
Binomial coefficients C(p, k), 2<=k<=p-2, sorted, with duplicates removed, p being prime.
- Expansion of (1 + x^2 - sqrt( 1 - 4*x + 2*x^2 + x^4)) / (2*x) in powers of x.A082582
Expansion of (1 + x^2 - sqrt( 1 - 4*x + 2*x^2 + x^4)) / (2*x) in powers of x.
- Quotients C(p, k)/p sorted, with duplicates removed, p being prime.A082583
Quotients C(p, k)/p sorted, with duplicates removed, p being prime.
- Fractal palindromic primes of first order.A082584
Fractal palindromic primes of first order.
- a(1)=1, a(n) = ceiling(r(5)*a(n-1)) where r(5) = (1/2)*(5 + sqrt(29)) is the positive root of X^2 = 5*X + 1.A082585
a(1)=1, a(n) = ceiling(r(5)*a(n-1)) where r(5) = (1/2)*(5 + sqrt(29)) is the positive root of X^2 = 5*X + 1.
- Length of the run of consecutive equal digits in the decimal expansion of Pi beginning at position n and ignoring any immediately-previous equal digits.A082586
Length of the run of consecutive equal digits in the decimal expansion of Pi beginning at position n and ignoring any immediately-previous equal digits.
- G.f.: (3+x+x^2+2*x^3)/(1-x^2-x^4).A082587
G.f.: (3+x+x^2+2*x^3)/(1-x^2-x^4).
- a(1) = 1, a(n) = Sum_{d | n and d < n} a(d)^2 for n > 1.A082588
a(1) = 1, a(n) = Sum_{d | n and d < n} a(d)^2 for n > 1.
- Fractal palindromic primes of third order.A082589
Fractal palindromic primes of third order.
- Expansion of 1/((1 - 2*x)*sqrt(1 - 4*x)).A082590
Expansion of 1/((1 - 2*x)*sqrt(1 - 4*x)).
- Starting position of the first occurrence of n in the decimal expansion of Pi such that a(n) > a(n-1) for n >= 1.A082591
Starting position of the first occurrence of n in the decimal expansion of Pi such that a(n) > a(n-1) for n >= 1.
- A077389 sorted and duplicates removed.A082592
A077389 sorted and duplicates removed.
- Values in Pfennigs of German money before the introduction of the Euro.A082593
Values in Pfennigs of German money before the introduction of the Euro.
- Constant term when a polynomial of degree n-1 is fitted to the first n primes.A082594
Constant term when a polynomial of degree n-1 is fitted to the first n primes.
- Let QR be the set of quadratic residues mod n: QR = {x^2 mod n, 1 <= x <= n-1}. Let MR be the set of values taken by 2^x mod n: MR = {2^x mod n, 0 <= x <= n-2}. Usually if QR is a subset of MR then n is prime and otherwise n is composite. Sequence gives numbers that violate this rule, i.e., composites where QR is a subset of MR and primes where QR is not a subset of MR.A082595
Let QR be the set of quadratic residues mod n: QR = {x^2 mod n, 1 <= x <= n-1}. Let MR be the set of values taken by 2^x mod n: MR = {2^x mod n, 0 <= x <= n-2}. Usually if QR is a subset of MR then n is prime and otherwise n is composite. Sequence gives numbers that violate this rule, i.e., composites where QR is a subset of MR and primes where QR is not a subset of MR.
- a(n) is the number of values of k such that A077389(k) = A060863(n).A082596
a(n) is the number of values of k such that A077389(k) = A060863(n).
- Number of sets of consecutive primes whose arithmetic mean is an integer, the largest prime of a set is n-th prime.A082597
Number of sets of consecutive primes whose arithmetic mean is an integer, the largest prime of a set is n-th prime.
- Palindromic prime units W appearing twice in first-order fractal palindromic primes WmW.A082598
Palindromic prime units W appearing twice in first-order fractal palindromic primes WmW.
- Palindromic prime units W appearing four times in second-order fractal palindromic primes WxWmWxW, where part WxW is also a palindromic prime.A082599
Palindromic prime units W appearing four times in second-order fractal palindromic primes WxWmWxW, where part WxW is also a palindromic prime.
- Palindromic prime units W appearing eight times in third-order fractal palindromic primes WvWxWvWmWvWxWvW, where parts WvWxWvW, WvW are also palindromic primes.A082600
Palindromic prime units W appearing eight times in third-order fractal palindromic primes WvWxWvWmWvWxWvW, where parts WvWxWvW, WvW are also palindromic primes.
- Tribonacci array: to get the next row, right-adjust the previous 3 rows and add them, then append a final 0.A082601
Tribonacci array: to get the next row, right-adjust the previous 3 rows and add them, then append a final 0.
- Number of primes between successive Fibonacci numbers (including possibly the Fibonacci numbers themselves).A082602
Number of primes between successive Fibonacci numbers (including possibly the Fibonacci numbers themselves).
- a(n) is the first prime greater than a(n-1) such that a(n)*a(n-1)+2 is a prime, with a(1)=3.A082603
a(n) is the first prime greater than a(n-1) such that a(n)*a(n-1)+2 is a prime, with a(1)=3.
- a(n) is the total number of positive integral solutions (x,y), order being taken into account, to the equation 1/x + 1/y + 1/z = 1/n.A082604
a(n) is the total number of positive integral solutions (x,y), order being taken into account, to the equation 1/x + 1/y + 1/z = 1/n.
- Using Euler's 6-term sequence A014556, we define the partial recurrence relation a(0)=2, a(1)=3, a(2)=5; a(k) = 2*a(k-1) - 1 - (-2)^(k-2), 3 <= k <= 5.A082605
Using Euler's 6-term sequence A014556, we define the partial recurrence relation a(0)=2, a(1)=3, a(2)=5; a(k) = 2*a(k-1) - 1 - (-2)^(k-2), 3 <= k <= 5.
- n-th powers arising in A083205.A082606
n-th powers arising in A083205.
- a(0)=1; for n > 0, a(n) = least k not included earlier such that k*a(n-1) - 1 is a square.A082607
a(0)=1; for n > 0, a(n) = least k not included earlier such that k*a(n-1) - 1 is a square.
- Squares pertaining to A082607. a(n) = A082607(n)*A082607(n+1)- 1.A082608
Squares pertaining to A082607. a(n) = A082607(n)*A082607(n+1)- 1.
- Begin with 1 and then smallest number not included earlier such that a(n)*a(n+1) -1 is a cube.A082609
Begin with 1 and then smallest number not included earlier such that a(n)*a(n+1) -1 is a cube.
- Cubes pertaining to A082609. a(n) = A082609(n)*A082609(n+1)- 1.A082610
Cubes pertaining to A082609. a(n) = A082609(n)*A082609(n+1)- 1.