Sequences
392,541 sequences
- Smallest prime factor of n*rad(n)+1, where rad = A007947 (squarefree kernel).A078311
Smallest prime factor of n*rad(n)+1, where rad = A007947 (squarefree kernel).
- Greatest prime factor of n*rad(n)+1, where rad = A007947 (squarefree kernel).A078312
Greatest prime factor of n*rad(n)+1, where rad = A007947 (squarefree kernel).
- Number of distinct prime factors of n*rad(n)+1, where rad=A007947 (squarefree kernel).A078313
Number of distinct prime factors of n*rad(n)+1, where rad=A007947 (squarefree kernel).
- Total number of prime factors of n*rad(n)+1 counted with multiplicity, where rad = A007947 (squarefree kernel).A078314
Total number of prime factors of n*rad(n)+1 counted with multiplicity, where rad = A007947 (squarefree kernel).
- Minimum exponent in prime factorization of n*rad(n)+1, where rad = A007947 (the radical or squarefree kernel).A078315
Minimum exponent in prime factorization of n*rad(n)+1, where rad = A007947 (the radical or squarefree kernel).
- Maximum exponent in the prime factorization of n*rad(n)+1, where rad = A007947 (squarefree kernel).A078316
Maximum exponent in the prime factorization of n*rad(n)+1, where rad = A007947 (squarefree kernel).
- Number of divisors of n*rad(n)+1, where rad = A007947 (squarefree kernel).A078317
Number of divisors of n*rad(n)+1, where rad = A007947 (squarefree kernel).
- Sum of divisors of n*rad(n)+1, where rad = A007947 (squarefree kernel).A078318
Sum of divisors of n*rad(n)+1, where rad = A007947 (squarefree kernel).
- Sum of distinct prime factors of n*rad(n)+1, where rad = A007947 (squarefree kernel).A078319
Sum of distinct prime factors of n*rad(n)+1, where rad = A007947 (squarefree kernel).
- Sum of all prime factors of n*rad(n)+1, where rad = A007947 (squarefree kernel).A078320
Sum of all prime factors of n*rad(n)+1, where rad = A007947 (squarefree kernel).
- Euler's totient of n*rad(n)+1, where rad = A007947 (squarefree kernel).A078321
Euler's totient of n*rad(n)+1, where rad = A007947 (squarefree kernel).
- a(n) = rad(n*rad(n)+1), where rad = A007947 (squarefree kernel).A078322
a(n) = rad(n*rad(n)+1), where rad = A007947 (squarefree kernel).
- Arithmetic derivative of n*rad(n)+1, where rad = A007947 (squarefree kernel).A078323
Arithmetic derivative of n*rad(n)+1, where rad = A007947 (squarefree kernel).
- Primes of the form m*rad(m)+1, where rad = A007947 (squarefree kernel).A078324
Primes of the form m*rad(m)+1, where rad = A007947 (squarefree kernel).
- Squarefree numbers of the form m*rad(m)+1, where rad = A007947 (squarefree kernel).A078325
Squarefree numbers of the form m*rad(m)+1, where rad = A007947 (squarefree kernel).
- Numbers n such that n-1 and n are a pair of consecutive powerful numbers.A078326
Numbers n such that n-1 and n are a pair of consecutive powerful numbers.
- Numbers k such that A078142(k) = A006530(k).A078327
Numbers k such that A078142(k) = A006530(k).
- Least m such that A078142(m) = A006530(m) = n-th prime.A078328
Least m such that A078142(m) = A006530(m) = n-th prime.
- Primes p such that mu(p+1)=-1, where mu denotes the moebius function.A078329
Primes p such that mu(p+1)=-1, where mu denotes the moebius function.
- Primes p such that mu(p-1) = -1, where mu is the Moebius function; that is, p-1 is squarefree and has an odd number of prime factors.A078330
Primes p such that mu(p-1) = -1, where mu is the Moebius function; that is, p-1 is squarefree and has an odd number of prime factors.
- First prime such that p^2==1 (mod n).A078331
First prime such that p^2==1 (mod n).
- First prime such that p^2 == -1 (mod n), or 0 if no such prime exists.A078332
First prime such that p^2 == -1 (mod n), or 0 if no such prime exists.
- Decimal expansion of sqrt(2)^sqrt(2).A078333
Decimal expansion of sqrt(2)^sqrt(2).
- Primes in A005728, which counts the terms in the Farey sequence of order n.A078334
Primes in A005728, which counts the terms in the Farey sequence of order n.
- Decimal expansion of largest real root of e^x = Gamma(x+1).A078335
Decimal expansion of largest real root of e^x = Gamma(x+1).
- Duplicate of A076441.A078336
Duplicate of A076441.
- Palindromes which are a nontrivial product of 2 palindromes (which need not be distinct).A078337
Palindromes which are a nontrivial product of 2 palindromes (which need not be distinct).
- Let u(1)=u(2)=u(3)=1 and u(n)=(-1)^n*sign(u(n-1)-u(n-2))*u(n-3), then a(n)=sum(k=1,n,u(k)).A078338
Let u(1)=u(2)=u(3)=1 and u(n)=(-1)^n*sign(u(n-1)-u(n-2))*u(n-3), then a(n)=sum(k=1,n,u(k)).
- Let u(1)=u(2)=u(3)=1 and u(n)=(-1)^n*sign(u(n-1)-u(n-2))*u(n-3); then a(n)=sum(k=1,n,sum(i=1,k,u(i))) - 3*(n-1).A078339
Let u(1)=u(2)=u(3)=1 and u(n)=(-1)^n*sign(u(n-1)-u(n-2))*u(n-3); then a(n)=sum(k=1,n,sum(i=1,k,u(i))) - 3*(n-1).
- Least k such that A078142(n) = A078142(n+k).A078340
Least k such that A078142(n) = A078142(n+k).
- Triangle read by rows: T(n,k) = n*T(n-1,k-1) + k*T(n-1,k) starting with T(0,0)=1.A078341
Triangle read by rows: T(n,k) = n*T(n-1,k-1) + k*T(n-1,k) starting with T(0,0)=1.
- Number of positive integers less than n that are coprime to all primes less than or equal to the square root of n.A078342
Number of positive integers less than n that are coprime to all primes less than or equal to the square root of n.
- a(0) = -1, a(1) = 2; a(n) = 2*a(n-1) + a(n-2).A078343
a(0) = -1, a(1) = 2; a(n) = 2*a(n-1) + a(n-2).
- a(1)=1; a(2)=2; a(3)=3; a(n) = Sum_{k=3..n-1} (a(k) + a(k-1) + a(k-2)).A078344
a(1)=1; a(2)=2; a(3)=3; a(n) = Sum_{k=3..n-1} (a(k) + a(k-1) + a(k-2)).
- Numbers k such that F(k) mod k divides F(F(k) mod k) where F(k) denotes the k-th Fibonacci number.A078345
Numbers k such that F(k) mod k divides F(F(k) mod k) where F(k) denotes the k-th Fibonacci number.
- a(1) = 1; a(n) = Sum_{k=1..n-1} a(floor((n-1)/k)).A078346
a(1) = 1; a(n) = Sum_{k=1..n-1} a(floor((n-1)/k)).
- Numbers k such that the number of ordered factorizations of k is > cototient(k).A078347
Numbers k such that the number of ordered factorizations of k is > cototient(k).
- Primes p such that every decimal digit d in p appears exactly d times.A078348
Primes p such that every decimal digit d in p appears exactly d times.
- Number of primes in sequence h(m) defined by h(1) = n, h(m+1) = Floor(h(m)/2).A078349
Number of primes in sequence h(m) defined by h(1) = n, h(m+1) = Floor(h(m)/2).
- 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.A078350
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 n X n matrices over an alphabet of size 17.A078351
Number of n X n matrices over an alphabet of size 17.
- Number of n X n matrices over an alphabet of size 18.A078352
Number of n X n matrices over an alphabet of size 18.
- Number of n X n matrices over an alphabet of size 19.A078353
Number of n X n matrices over an alphabet of size 19.
- Number of n X n matrices over an alphabet of size 20.A078354
Number of n X n matrices over an alphabet of size 20.
- Minimal (positive) solution a(n) of Pell equation b(n)^2 - D(n)*a(n)^2 = +4 with D(n)= A077425(n). The companion sequence is a(n)=A077428(n).A078355
Minimal (positive) solution a(n) of Pell equation b(n)^2 - D(n)*a(n)^2 = +4 with D(n)= A077425(n). The companion sequence is a(n)=A077428(n).
- Minimal positive solution z of Pell equation z^2 - A077426(n)*t^2 = -4.A078356
Minimal positive solution z of Pell equation z^2 - A077426(n)*t^2 = -4.
- Minimal positive solution x of Pell equation y^2 - A077426(n)*x^2 = -4.A078357
Minimal positive solution x of Pell equation y^2 - A077426(n)*x^2 = -4.
- Non-oblong numbers: Complement of A002378.A078358
Non-oblong numbers: Complement of A002378.
- Number of ways to write n as sum of a positive square and a positive cube.A078359
Number of ways to write n as sum of a positive square and a positive cube.
- Numbers having a unique representation as sum of a positive square and a positive cube.A078360
Numbers having a unique representation as sum of a positive square and a positive cube.