Sequences
392,541 sequences
- Increasing partial quotients of e^gamma.A064411
Increasing partial quotients of e^gamma.
- At stage 1, start with a unit equilateral equiangular triangle. At each successive stage add 3*(n-1) new triangles around outside with edge-to-edge contacts. Sequence gives number of triangles (regardless of size) at n-th stage.A064412
At stage 1, start with a unit equilateral equiangular triangle. At each successive stage add 3*(n-1) new triangles around outside with edge-to-edge contacts. Sequence gives number of triangles (regardless of size) at n-th stage.
- EKG sequence (or ECG sequence): a(1) = 1; a(2) = 2; for n > 2, a(n) = smallest number not already used which shares a factor with a(n-1).A064413
EKG sequence (or ECG sequence): a(1) = 1; a(2) = 2; for n > 2, a(n) = smallest number not already used which shares a factor with a(n-1).
- Numbers that divide at least one term in every Fibonacci sequence.A064414
Numbers that divide at least one term in every Fibonacci sequence.
- a(1) = 0, a(n) = iter(n) if n is even, a(n) = iter(n)-1 if n is odd, where iter(n) = A003434(n) = smallest number of iterations of Euler totient function phi needed to reach 1.A064415
a(1) = 0, a(n) = iter(n) if n is even, a(n) = iter(n)-1 if n is odd, where iter(n) = A003434(n) = smallest number of iterations of Euler totient function phi needed to reach 1.
- Number of integers q such that phiter(q)=n where phiter(n) = A064415(n).A064416
Number of integers q such that phiter(q)=n where phiter(n) = A064415(n).
- a(1) = 1, a(2) = 2, a(3) = 3; for n >3 a(n) = smallest number not already used such that gcd(a(n), a(n-1)) >= 3.A064417
a(1) = 1, a(2) = 2, a(3) = 3; for n >3 a(n) = smallest number not already used such that gcd(a(n), a(n-1)) >= 3.
- a(1) = 1, a(2) = 2, a(3) = 3, a(4) = 4; for n > 4, a(n) = smallest number not already used such that gcd(a(n), a(n-1)) >= 4.A064418
a(1) = 1, a(2) = 2, a(3) = 3, a(4) = 4; for n > 4, a(n) = smallest number not already used such that gcd(a(n), a(n-1)) >= 4.
- a(n) = n for n <= 5; for n > 5, a(n) = smallest number not already used such that gcd(a(n), a(n-1)) >= 5.A064419
a(n) = n for n <= 5; for n > 5, a(n) = smallest number not already used such that gcd(a(n), a(n-1)) >= 5.
- Numbers k such that A064413(k+1) = k. Probably complete.A064420
Numbers k such that A064413(k+1) = k. Probably complete.
- Term at which n appears in A064413 (if it begins at 2).A064421
Term at which n appears in A064413 (if it begins at 2).
- Football league numbers: the possible point series for a league of n teams playing each other twice where for each match 3 points are awarded to the winning team and 1 to each in the case of a tie.A064422
Football league numbers: the possible point series for a league of n teams playing each other twice where for each match 3 points are awarded to the winning team and 1 to each in the case of a tie.
- Position of n-th prime in A064413 (if it begins at 2).A064423
Position of n-th prime in A064413 (if it begins at 2).
- Record high values in A064413.A064424
Record high values in A064413.
- Gaps between where primes occur in A064413.A064425
Gaps between where primes occur in A064413.
- First differences of A064413.A064426
First differences of A064413.
- a(n) = n + (number of primes < n).A064427
a(n) = n + (number of primes < n).
- Number of partitions of n with nonnegative crank.A064428
Number of partitions of n with nonnegative crank.
- a(n) = floor(n / 3) * 3 + sign(n mod 3) * (3 - n mod 3).A064429
a(n) = floor(n / 3) * 3 + sign(n mod 3) * (3 - n mod 3).
- Product of the sizes of the conjugacy classes of the symmetric group S_n.A064430
Product of the sizes of the conjugacy classes of the symmetric group S_n.
- Numbers n such that |A053222(n)| = tau(n).A064431
Numbers n such that |A053222(n)| = tau(n).
- Least k such that k*10^n-9, k*10^n-7, k*10^n-3 and k*10^n-1 are all prime.A064432
Least k such that k*10^n-9, k*10^n-7, k*10^n-3 and k*10^n-1 are all prime.
- Number of iterations of A064455 to reach 2 (or 1 in the case of 1).A064433
Number of iterations of A064455 to reach 2 (or 1 in the case of 1).
- a(n) = (2*a(n-1) + 1) mod n.A064434
a(n) = (2*a(n-1) + 1) mod n.
- Duplicate of A020488.A064435
Duplicate of A020488.
- Number of switching functions of n or fewer variables which cannot be realized as threshold gates.A064436
Number of switching functions of n or fewer variables which cannot be realized as threshold gates.
- a(1)=1, a(n) = a(n-1) + 3 if n is already in the sequence, a(n) = a(n-1) + 2 otherwise.A064437
a(1)=1, a(n) = a(n-1) + 3 if n is already in the sequence, a(n) = a(n-1) + 2 otherwise.
- Numbers which are divisible by the sum of their quaternary digits.A064438
Numbers which are divisible by the sum of their quaternary digits.
- Numbers n such that sigma(n) - n - 1 = pi(n).A064439
Numbers n such that sigma(n) - n - 1 = pi(n).
- Numbers k such that A048138(k) is a prime and sets a new record for such primes.A064440
Numbers k such that A048138(k) is a prime and sets a new record for such primes.
- Increasing partial quotients of e^Pi - Pi^e (A063504).A064441
Increasing partial quotients of e^Pi - Pi^e (A063504).
- Decimal expansion of number with continued fraction expansion 2, 3, 5, 7, 11, 13, 17, 19, ... = 2.3130367364335829063839516 ...A064442
Decimal expansion of number with continued fraction expansion 2, 3, 5, 7, 11, 13, 17, 19, ... = 2.3130367364335829063839516 ...
- Numbers k such that usigma(k) is a square and sets a new record for such squares.A064443
Numbers k such that usigma(k) is a square and sets a new record for such squares.
- Numbers k such that pi(k) = sopf(k) where sopf(k) is sum of distinct prime factors of k (A008472).A064444
Numbers k such that pi(k) = sopf(k) where sopf(k) is sum of distinct prime factors of k (A008472).
- Numbers k such that sopf(k) - pi(k) = tau(k).A064445
Numbers k such that sopf(k) - pi(k) = tau(k).
- a(n) = gcd(n!, n^n, lcm(1, 2, ..., n)), or gcd(n^n, lcm(1, 2, ..., n)).A064446
a(n) = gcd(n!, n^n, lcm(1, 2, ..., n)), or gcd(n^n, lcm(1, 2, ..., n)).
- a(n) = phi(n^n).A064447
a(n) = phi(n^n).
- a(n) = gcd(n^n, phi(n^n)).A064448
a(n) = gcd(n^n, phi(n^n)).
- a(n) = gcd(Phi(n!), Phi(n^n), Phi(lcm(1..n))).A064449
a(n) = gcd(Phi(n!), Phi(n^n), Phi(lcm(1..n))).
- Sum of totients of binomial coefficients C(n,j), j=0..n.A064450
Sum of totients of binomial coefficients C(n,j), j=0..n.
- LCM of totients of binomial coefficients C(n,j), j = 0..n.A064451
LCM of totients of binomial coefficients C(n,j), j = 0..n.
- Integers which are not primes or powers of primes such that for all j>i Phi(j)/j > Phi(i)/i.A064452
Integers which are not primes or powers of primes such that for all j>i Phi(j)/j > Phi(i)/i.
- Number of finite positive integer sequences b(1),...,b(k), with k <= n and b(1)*b(2)*...*b(k) <= n.A064453
Number of finite positive integer sequences b(1),...,b(k), with k <= n and b(1)*b(2)*...*b(k) <= n.
- Erroneous version of A064461.A064454
Erroneous version of A064461.
- a(2n) = 3n, a(2n-1) = n.A064455
a(2n) = 3n, a(2n-1) = n.
- A064434(n) = 0.A064456
A064434(n) = 0.
- a(1) = 3; for n > 1, choose a(n) to be the smallest number such that a(n) > a(n-1) and (a(n)*a(n-1)+1) mod (a(n)+a(n-1)+1) = 0.A064457
a(1) = 3; for n > 1, choose a(n) to be the smallest number such that a(n) > a(n-1) and (a(n)*a(n-1)+1) mod (a(n)+a(n-1)+1) = 0.
- Highest power of 11 dividing n!.A064458
Highest power of 11 dividing n!.
- a(n) = Sum_{k>=1} floor(n/12^k).A064459
a(n) = Sum_{k>=1} floor(n/12^k).
- Number of distinct nonsquarefree entries in n-th row of Pascal's triangle.A064460
Number of distinct nonsquarefree entries in n-th row of Pascal's triangle.