Sequences
392,541 sequences
- Minimal positive solution a(n) of Pell equation a(n)^2 - D(n)*b(n)^2 = +4 or -4 with D(n)=A077425(n). The companion sequence is b(n)=A077058(n).A078361
Minimal positive solution a(n) of Pell equation a(n)^2 - D(n)*b(n)^2 = +4 or -4 with D(n)=A077425(n). The companion sequence is b(n)=A077058(n).
- A Chebyshev S-sequence with Diophantine property.A078362
A Chebyshev S-sequence with Diophantine property.
- A Chebyshev T-sequence with Diophantine property.A078363
A Chebyshev T-sequence with Diophantine property.
- A Chebyshev S-sequence with Diophantine property.A078364
A Chebyshev S-sequence with Diophantine property.
- A Chebyshev T-sequence with Diophantine property.A078365
A Chebyshev T-sequence with Diophantine property.
- A Chebyshev S-sequence with Diophantine property.A078366
A Chebyshev S-sequence with Diophantine property.
- A Chebyshev T-sequence with Diophantine property.A078367
A Chebyshev T-sequence with Diophantine property.
- A Chebyshev S-sequence with Diophantine property.A078368
A Chebyshev S-sequence with Diophantine property.
- A Chebyshev T-sequence with Diophantine property.A078369
A Chebyshev T-sequence with Diophantine property.
- a(n) = 4*(n+1)*n + 5.A078370
a(n) = 4*(n+1)*n + 5.
- a(n) = (2*n+5)*(2*n+1).A078371
a(n) = (2*n+5)*(2*n+1).
- Number of squarefree integers in {n, f(n), f(f(n)), ...., 1}, where f is the Collatz function defined by f(x) = x/2 if x is even; f(x) = 3x + 1 if x is odd.A078372
Number of squarefree integers in {n, f(n), f(f(n)), ...., 1}, where f is the Collatz function defined by f(x) = x/2 if x is even; f(x) = 3x + 1 if x is odd.
- n sets a record for the number of primes in {n, f(n), f(f(n)), ..., 1}, where f is the Collatz function defined by f(x) = x/2 if x is even; f(x) = 3x + 1 if x is odd.A078373
n sets a record for the number of primes in {n, f(n), f(f(n)), ..., 1}, where f is the Collatz function defined by f(x) = x/2 if x is even; f(x) = 3x + 1 if x is odd.
- Number of partitions of n into distinct and relatively prime parts.A078374
Number of partitions of n into distinct and relatively prime parts.
- Smallest prime factor of numbers which can be written as sum of a positive square and a positive cube.A078375
Smallest prime factor of numbers which can be written as sum of a positive square and a positive cube.
- Greatest prime factor of numbers which can be written as sum of a positive square and a positive cube.A078376
Greatest prime factor of numbers which can be written as sum of a positive square and a positive cube.
- Number of distinct prime factors of numbers which can be written as sum of a positive square and a positive cube.A078377
Number of distinct prime factors of numbers which can be written as sum of a positive square and a positive cube.
- Total number of prime factors of numbers which can be written as sum of a positive square and a positive cube.A078378
Total number of prime factors of numbers which can be written as sum of a positive square and a positive cube.
- Minimum exponent in prime factorization of numbers which can be written as sum of a positive square and a positive cube.A078379
Minimum exponent in prime factorization of numbers which can be written as sum of a positive square and a positive cube.
- Maximum exponent in prime factorization of numbers which can be written as sum of a positive square and a positive cube.A078380
Maximum exponent in prime factorization of numbers which can be written as sum of a positive square and a positive cube.
- Number of divisors of numbers which can be written as sum of a positive square and a positive cube.A078381
Number of divisors of numbers which can be written as sum of a positive square and a positive cube.
- Sum of divisors of numbers which can be written as sum of a positive square and a positive cube.A078382
Sum of divisors of numbers which can be written as sum of a positive square and a positive cube.
- Sum of distinct prime factors of numbers which can be written as sum of a positive square and a positive cube.A078383
Sum of distinct prime factors of numbers which can be written as sum of a positive square and a positive cube.
- Sum of all prime factors of numbers which can be written as sum of a positive square and a positive cube.A078384
Sum of all prime factors of numbers which can be written as sum of a positive square and a positive cube.
- Euler's totient of numbers which can be written as sum of a positive square and a positive cube.A078385
Euler's totient of numbers which can be written as sum of a positive square and a positive cube.
- Squarefree kernels of numbers which can be written as sum of a positive square and a positive cube.A078386
Squarefree kernels of numbers which can be written as sum of a positive square and a positive cube.
- Moebius's mu of numbers which can be written as sum of a positive square and a positive cube.A078387
Moebius's mu of numbers which can be written as sum of a positive square and a positive cube.
- Arithmetic derivative of numbers which can be written as sum of a positive square and a positive cube.A078388
Arithmetic derivative of numbers which can be written as sum of a positive square and a positive cube.
- Number of different values obtained by evaluating all different parenthesizations of 1/2/3/4/.../n.A078389
Number of different values obtained by evaluating all different parenthesizations of 1/2/3/4/.../n.
- Composite numbers which can be written as sum of a positive square and a positive cube.A078390
Composite numbers which can be written as sum of a positive square and a positive cube.
- Triangle read by rows: T(n,k) = Catalan(k)*Catalan(n-k).A078391
Triangle read by rows: T(n,k) = Catalan(k)*Catalan(n-k).
- Sum of GCD's of parts in all partitions of n.A078392
Sum of GCD's of parts in all partitions of n.
- Squarefree numbers which can be written as sum of a positive square and a positive cube.A078393
Squarefree numbers which can be written as sum of a positive square and a positive cube.
- Numbers k such that reverse(A004154(k)) + 1 is prime.A078394
Numbers k such that reverse(A004154(k)) + 1 is prime.
- a(1) = 1, a(n) for n > 1 is the smallest multiple of a(n-1) that begins with the reverse concatenation from n to 1.A078395
a(1) = 1, a(n) for n > 1 is the smallest multiple of a(n-1) that begins with the reverse concatenation from n to 1.
- a(n) = A078395(n+1)/A078395(n).A078396
a(n) = A078395(n+1)/A078395(n).
- a(n) = A078296(n+1)/A078296(n).A078397
a(n) = A078296(n+1)/A078296(n).
- a(1) = 1; a(n) for n > 1 is the smallest multiple of a(n-1) that begins with n concatenations of n.A078398
a(1) = 1; a(n) for n > 1 is the smallest multiple of a(n-1) that begins with n concatenations of n.
- a(n) = A078398(n+1)/A078398(n).A078399
a(n) = A078398(n+1)/A078398(n).
- Iterated sum-of-digits of A078403(n).A078400
Iterated sum-of-digits of A078403(n).
- Triangle read by rows: T(n,k) = number of numbers <= k that are coprime to n, 1 <= k <= n.A078401
Triangle read by rows: T(n,k) = number of numbers <= k that are coprime to n, 1 <= k <= n.
- Numbers k such that k^2 + 5 is prime.A078402
Numbers k such that k^2 + 5 is prime.
- Primes whose digital root (A038194) is prime.A078403
Primes whose digital root (A038194) is prime.
- Expansion of Molien series for a certain 4-D group of order 192.A078404
Expansion of Molien series for a certain 4-D group of order 192.
- Smallest positive integer than cannot be obtained from exactly n copies of n using parentheses and the operations +, -, /, *, ^ and concatenation.A078405
Smallest positive integer than cannot be obtained from exactly n copies of n using parentheses and the operations +, -, /, *, ^ and concatenation.
- Number of ways to partition 4*n into distinct positive integers.A078406
Number of ways to partition 4*n into distinct positive integers.
- Number of ways to partition 4*n+2 into distinct positive integers.A078407
Number of ways to partition 4*n+2 into distinct positive integers.
- Number of ways to partition 2n+1 into distinct positive integers.A078408
Number of ways to partition 2n+1 into distinct positive integers.
- Number of ways to partition 4*n+1 into distinct positive integers.A078409
Number of ways to partition 4*n+1 into distinct positive integers.
- Number of ways to partition 4*n+3 into distinct positive integers.A078410
Number of ways to partition 4*n+3 into distinct positive integers.