Sequences
392,541 sequences
- Coefficient of q^1 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(3,1).A074361
Coefficient of q^1 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(3,1).
- Coefficient of q^2 in nu(n), where nu(0) = 1, nu(1) = b and, for n >= 2, nu(n) = b*nu(n-1) + lambda*(1 + q + q^2 + ... + q^(n-2))*nu(n-2) with (b,lambda) = (3,1).A074362
Coefficient of q^2 in nu(n), where nu(0) = 1, nu(1) = b and, for n >= 2, nu(n) = b*nu(n-1) + lambda*(1 + q + q^2 + ... + q^(n-2))*nu(n-2) with (b,lambda) = (3,1).
- Coefficient of q^3 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(3,1).A074363
Coefficient of q^3 in nu(n), where nu(0)=1, nu(1)=b and, for n>=2, nu(n)=b*nu(n-1)+lambda*(1+q+q^2+...+q^(n-2))*nu(n-2) with (b,lambda)=(3,1).
- Semi-tribonacci numbers, from tribonacci by analogy with semi-Fibonacci sequence.A074364
Semi-tribonacci numbers, from tribonacci by analogy with semi-Fibonacci sequence.
- Smallest prime > the concatenation of the first n natural numbers.A074365
Smallest prime > the concatenation of the first n natural numbers.
- The first prime greater than the concatenation of the first n primes.A074366
The first prime greater than the concatenation of the first n primes.
- (p^2-5)/4 for odd primes p.A074367
(p^2-5)/4 for odd primes p.
- Rearrangement of odd numbers such that a(k) + a(k+1) + 1 is a prime for all k.A074368
Rearrangement of odd numbers such that a(k) + a(k+1) + 1 is a prime for all k.
- Number of divisors of Sum_{i=1..n} prime(i).A074369
Number of divisors of Sum_{i=1..n} prime(i).
- Sum of the divisors of Sum_{i=1..n} prime(i).A074370
Sum of the divisors of Sum_{i=1..n} prime(i).
- Sigmabonacci numbers: a(n)=a(n-1)+Sigma(a(n-2)). Sigma(n)=Sum of divisors of n.A074371
Sigmabonacci numbers: a(n)=a(n-1)+Sigma(a(n-2)). Sigma(n)=Sum of divisors of n.
- 1 + the sum of the distinct primes dividing n.A074372
1 + the sum of the distinct primes dividing n.
- Square of the sum of the prime factors of n (with repetition).A074373
Square of the sum of the prime factors of n (with repetition).
- a(n) = sopfr(n)*(sopfr(n)+1)/2 where sopfr is the sum of the prime factors of n with repetition (A001414).A074374
a(n) = sopfr(n)*(sopfr(n)+1)/2 where sopfr is the sum of the prime factors of n with repetition (A001414).
- s(s+3)/2 where s is the sum of the prime factors of n (with repetition).A074375
s(s+3)/2 where s is the sum of the prime factors of n (with repetition).
- s(3s-1)/2 where s is the sum of the prime factors of n (with repetition).A074376
s(3s-1)/2 where s is the sum of the prime factors of n (with repetition).
- Generalized 10-gonal numbers: m*(4*m - 3) for m = 0, +- 1, +- 2, +- 3, ...A074377
Generalized 10-gonal numbers: m*(4*m - 3) for m = 0, +- 1, +- 2, +- 3, ...
- Even triangular numbers halved.A074378
Even triangular numbers halved.
- Carmichael numbers with exactly 4 prime factors.A074379
Carmichael numbers with exactly 4 prime factors.
- Sarrus numbers n (A001567) which satisfy mu(n) = -1 and which are not Super-Poulet numbers (A050217).A074380
Sarrus numbers n (A001567) which satisfy mu(n) = -1 and which are not Super-Poulet numbers (A050217).
- (p-1)/2 mod 2, where p is the n-th prime for which p+2 is also prime; i.e., a(n)=0 if p==1 (mod 4), a(n)=1 if p==3 (mod 4).A074381
(p-1)/2 mod 2, where p is the n-th prime for which p+2 is also prime; i.e., a(n)=0 if p==1 (mod 4), a(n)=1 if p==3 (mod 4).
- Difference between (1+3^n)-th and (3^n)-th primes.A074382
Difference between (1+3^n)-th and (3^n)-th primes.
- Difference between (1+10^n)-th and (10^n)-th primes.A074383
Difference between (1+10^n)-th and (10^n)-th primes.
- Solutions to mod(sigma(x), 6) = 5.A074384
Solutions to mod(sigma(x), 6) = 5.
- Square root of sum of divisors, when it is a square.A074385
Square root of sum of divisors, when it is a square.
- Numbers k such that sigma(k) is the square of a prime.A074386
Numbers k such that sigma(k) is the square of a prime.
- Duplicate of A008848.A074387
Duplicate of A008848.
- Numbers of the form 2*k^2 such that sigma(2*k^2) is an odd square.A074388
Numbers of the form 2*k^2 such that sigma(2*k^2) is an odd square.
- a(n) = gcd(n, sigma(n), phi(n)).A074389
a(n) = gcd(n, sigma(n), phi(n)).
- a(n) is the least number k that A074389(k) = n.A074390
a(n) is the least number k that A074389(k) = n.
- a(n) is the smallest number such that gcd(a(n), sigma(a(n))) = n.A074391
a(n) is the smallest number such that gcd(a(n), sigma(a(n))) = n.
- a(n) = Lucas(n+1) + (3*(-1)^n - 1)/2.A074392
a(n) = Lucas(n+1) + (3*(-1)^n - 1)/2.
- Number of primes between sigma(n) and phi(n) exclusive, minus 1 if sigma(n) is a prime.A074393
Number of primes between sigma(n) and phi(n) exclusive, minus 1 if sigma(n) is a prime.
- a(n) = a(n-1)*a(n-2) - a(n-3) with a(1) = 1, a(2) = 2, and a(3) = 3.A074394
a(n) = a(n-1)*a(n-2) - a(n-3) with a(1) = 1, a(2) = 2, and a(3) = 3.
- A 7-way classification of the primes.A074395
A 7-way classification of the primes.
- a(n) = 10 - (p mod 10), where p is the n-th prime congruent to 1 (mod 4) for which p+2 is also prime.A074396
a(n) = 10 - (p mod 10), where p is the n-th prime congruent to 1 (mod 4) for which p+2 is also prime.
- Number of primes between sigma(n) and n exclusive.A074397
Number of primes between sigma(n) and n exclusive.
- Number of primes between n and phi(n), with neither n nor phi(n) included in the count in case they are primes.A074398
Number of primes between n and phi(n), with neither n nor phi(n) included in the count in case they are primes.
- a(n) is the largest prime divisor of n(n+1).A074399
a(n) is the largest prime divisor of n(n+1).
- Sum of the even divisors of 2n.A074400
Sum of the even divisors of 2n.
- 2^n contains all divisors of n as substrings.A074401
2^n contains all divisors of n as substrings.
- Multiplicative closure of Euler's "numeri idonei" (A000926).A074402
Multiplicative closure of Euler's "numeri idonei" (A000926).
- Number of 4-ary Lyndon words of length n over Z_4 with trace 0 and subtrace 1.A074403
Number of 4-ary Lyndon words of length n over Z_4 with trace 0 and subtrace 1.
- Number of 4-ary Lyndon words of length n over Z_4 with trace 0 and subtrace 2.A074404
Number of 4-ary Lyndon words of length n over Z_4 with trace 0 and subtrace 2.
- Number of 4-ary Lyndon words of length n over Z_4 with trace 0 and subtrace 3.A074405
Number of 4-ary Lyndon words of length n over Z_4 with trace 0 and subtrace 3.
- Number of 4-ary Lyndon words of length n over Z_4 with trace 1 and subtrace 0.A074406
Number of 4-ary Lyndon words of length n over Z_4 with trace 1 and subtrace 0.
- Number of 4-ary Lyndon words of length n over Z_4 with trace 1 and subtrace 1.A074407
Number of 4-ary Lyndon words of length n over Z_4 with trace 1 and subtrace 1.
- Number of 4-ary Lyndon words of length n over Z_4 with trace 1 and subtrace 2.A074408
Number of 4-ary Lyndon words of length n over Z_4 with trace 1 and subtrace 2.
- Number of 4-ary Lyndon words of length n over Z_4 with trace 1 and subtrace 3.A074409
Number of 4-ary Lyndon words of length n over Z_4 with trace 1 and subtrace 3.
- Number of 4-ary Lyndon words of length n over Z_4 with trace 2 and subtrace 0.A074410
Number of 4-ary Lyndon words of length n over Z_4 with trace 2 and subtrace 0.