Sequences
392,541 sequences
- Numbers n such that sopfr(n) and d(n) are both perfect numbers.A070311
Numbers n such that sopfr(n) and d(n) are both perfect numbers.
- a(1) = a(2) = 1; a(n) = a(n-1) + concatenation of a(n-2) and a(n-1).A070312
a(1) = a(2) = 1; a(n) = a(n-1) + concatenation of a(n-2) and a(n-1).
- a(n) = 2^n - (2*n+1).A070313
a(n) = 2^n - (2*n+1).
- a(n) = P(n!+1)-P(2^n+1) where P(x) is the largest prime factor in x.A070314
a(n) = P(n!+1)-P(2^n+1) where P(x) is the largest prime factor in x.
- Third diagonal of triangle in A046739.A070315
Third diagonal of triangle in A046739.
- Numbers n such that nextprime(n^2)-n^2 (n>=1) sets a new record.A070316
Numbers n such that nextprime(n^2)-n^2 (n>=1) sets a new record.
- Record values of nextprime(n^2)-n^2, cf. A070316.A070317
Record values of nextprime(n^2)-n^2, cf. A070316.
- a(n) = Max_{k=1..n} (sigma(k)-k) where sigma(k)-k is the sum of proper divisors of k.A070318
a(n) = Max_{k=1..n} (sigma(k)-k) where sigma(k)-k is the sum of proper divisors of k.
- a(n) = Max_{k=1..n} tau(k) where tau(x)=A000005(x) is the number of divisors of x.A070319
a(n) = Max_{k=1..n} tau(k) where tau(x)=A000005(x) is the number of divisors of x.
- a(n) = Max( phi(k) : k=1..n ).A070320
a(n) = Max( phi(k) : k=1..n ).
- Greatest squarefree number <= n.A070321
Greatest squarefree number <= n.
- Number of primitive n X n real (0,1)-matrices.A070322
Number of primitive n X n real (0,1)-matrices.
- Let M_n be the n X n matrix m(i,j) = min(prime(i), prime(j)); then a(n) = det(M_n).A070323
Let M_n be the n X n matrix m(i,j) = min(prime(i), prime(j)); then a(n) = det(M_n).
- a(n) = Max( sigma(k) : k=1,2,3,...,n ).A070324
a(n) = Max( sigma(k) : k=1,2,3,...,n ).
- Numbers k such that k+1, k^2+1 and k^4+1 are primes.A070325
Numbers k such that k+1, k^2+1 and k^4+1 are primes.
- Upper triangular array giving for each (x,y) the minimum modulus m such that x^3+y^3 is not congruent to a cube (mod m).A070326
Upper triangular array giving for each (x,y) the minimum modulus m such that x^3+y^3 is not congruent to a cube (mod m).
- Smallest nontrivial power of n starting with n and greater than n.A070327
Smallest nontrivial power of n starting with n and greater than n.
- Numbers in which inserting, prefixing or suffixing a 1 anywhere yields only composite numbers.A070328
Numbers in which inserting, prefixing or suffixing a 1 anywhere yields only composite numbers.
- Nontrivial numbers in which inserting, prefixing or suffixing a 1 anywhere yields only composite numbers.A070329
Nontrivial numbers in which inserting, prefixing or suffixing a 1 anywhere yields only composite numbers.
- Nontrivial numbers in which suffixing or inserting a 0 anywhere yields only composite numbers.A070330
Nontrivial numbers in which suffixing or inserting a 0 anywhere yields only composite numbers.
- Numbers in which suffixing or inserting a 0 anywhere yields only composite numbers.A070331
Numbers in which suffixing or inserting a 0 anywhere yields only composite numbers.
- Smallest nontrivial power of n ending in n and greater than n; or 0 if no such number exists.A070332
Smallest nontrivial power of n ending in n and greater than n; or 0 if no such number exists.
- Expansion of (1 + x)*(1 - x + x^2)/((1 - x)^4*(1 + x + x^2)).A070333
Expansion of (1 + x)*(1 - x + x^2)/((1 - x)^4*(1 + x + x^2)).
- Erroneous version of A001318.A070334
Erroneous version of A001318.
- a(n) = 2^n mod 23.A070335
a(n) = 2^n mod 23.
- a(n) = 2^n mod 25.A070336
a(n) = 2^n mod 25.
- a(n) = 2^n mod 27.A070337
a(n) = 2^n mod 27.
- a(n) = 2^n mod 33.A070338
a(n) = 2^n mod 33.
- a(n) = 2^n mod 35.A070339
a(n) = 2^n mod 35.
- a(n) = 2^n mod 39.A070340
a(n) = 2^n mod 39.
- a(n) = 3^n mod 11: Repeat (1, 3, 9, 5, 4), period 5.A070341
a(n) = 3^n mod 11: Repeat (1, 3, 9, 5, 4), period 5.
- a(n) = 3^n mod 19.A070342
a(n) = 3^n mod 19.
- a(n) = 3^n mod 25.A070343
a(n) = 3^n mod 25.
- a(n) = 3^n mod 29.A070344
a(n) = 3^n mod 29.
- a(n) = 3^n mod 35.A070345
a(n) = 3^n mod 35.
- a(n) = 3^n mod 37.A070346
a(n) = 3^n mod 37.
- a(n) = 2^n mod 21.A070347
a(n) = 2^n mod 21.
- a(n) = 2^n mod 41.A070348
a(n) = 2^n mod 41.
- a(n) = 2^n mod 43.A070349
a(n) = 2^n mod 43.
- a(n) = 2^n mod 45.A070350
a(n) = 2^n mod 45.
- a(n) = 2^n mod 47.A070351
a(n) = 2^n mod 47.
- a(n) = 3^n mod 5; or period 4, repeat [1, 3, 4, 2].A070352
a(n) = 3^n mod 5; or period 4, repeat [1, 3, 4, 2].
- a(n) = 3^n mod 14.A070353
a(n) = 3^n mod 14.
- a(n) = 3^n mod 16.A070354
a(n) = 3^n mod 16.
- a(n) = 3^n mod 22.A070355
a(n) = 3^n mod 22.
- a(n) = 3^n mod 23.A070356
a(n) = 3^n mod 23.
- a(n) = 3^n mod 28.A070357
a(n) = 3^n mod 28.
- a(n) = 3^n mod 32.A070358
a(n) = 3^n mod 32.
- a(n) = 3^n mod 34.A070359
a(n) = 3^n mod 34.
- a(n) = 3^n mod 38.A070360
a(n) = 3^n mod 38.