Sequences
392,541 sequences
- Numbers that can be written as sum of a prime and an 3-smooth number.A081311
Numbers that can be written as sum of a prime and an 3-smooth number.
- Numbers having a unique representation as sum of a prime and an 3-smooth number.A081312
Numbers having a unique representation as sum of a prime and an 3-smooth number.
- Numbers having more than one representation as sum of a prime and a 3-smooth number.A081313
Numbers having more than one representation as sum of a prime and a 3-smooth number.
- Order of symmetry groups of n points on 3-dimensional sphere with the volume enclosed by their convex hull maximized.A081314
Order of symmetry groups of n points on 3-dimensional sphere with the volume enclosed by their convex hull maximized.
- Lexicographically earliest sequence of positive integers such that n occurs a(n)-1 times, starting at n=0.A081315
Lexicographically earliest sequence of positive integers such that n occurs a(n)-1 times, starting at n=0.
- Lexicographically earliest sequence of positive integers such that n occurs a(n)-1 times, starting at n=1.A081316
Lexicographically earliest sequence of positive integers such that n occurs a(n)-1 times, starting at n=1.
- Primes p such that p divides 10^n-1, p is the largest prime producing decimal fraction period n and p is not the largest prime dividing 10^n-1.A081317
Primes p such that p divides 10^n-1, p is the largest prime producing decimal fraction period n and p is not the largest prime dividing 10^n-1.
- Integers n such that the reciprocal of the largest prime factor of 10^n-1 is not a repeating decimal fraction with a period of n.A081318
Integers n such that the reciprocal of the largest prime factor of 10^n-1 is not a repeating decimal fraction with a period of n.
- Smallest squarefree integer k such that Q(sqrt(-k)) has class number n, or 0 if no such k exists.A081319
Smallest squarefree integer k such that Q(sqrt(-k)) has class number n, or 0 if no such k exists.
- Largest 3-smooth divisor of n-th Fibonacci number.A081320
Largest 3-smooth divisor of n-th Fibonacci number.
- a(n) = (2/3)*(2*n+1)*(2*n-1)!*binomial(3*n,2*n).A081321
a(n) = (2/3)*(2*n+1)*(2*n-1)!*binomial(3*n,2*n).
- F(P(n)), where F(n) = Fibonacci numbers A000045, P(n) = Pell numbers A000129.A081322
F(P(n)), where F(n) = Fibonacci numbers A000045, P(n) = Pell numbers A000129.
- a(n) = L(P(n)), where L = Lucas numbers A000032, P = Pell numbers A000129.A081323
a(n) = L(P(n)), where L = Lucas numbers A000032, P = Pell numbers A000129.
- Twice a square but not the sum of 2 distinct squares.A081324
Twice a square but not the sum of 2 distinct squares.
- a(n) = sigma(n^2) modulo 4.A081325
a(n) = sigma(n^2) modulo 4.
- Number of partitions of n into two 3-smooth numbers.A081326
Number of partitions of n into two 3-smooth numbers.
- Smallest 3-smooth number m such that n-m is also 3-smooth, a(n)=0 if no such 3-smooth number exists.A081327
Smallest 3-smooth number m such that n-m is also 3-smooth, a(n)=0 if no such 3-smooth number exists.
- Greatest 3-smooth number m such that n-m is also 3-smooth, a(n)=0 if no such 3-smooth number exists.A081328
Greatest 3-smooth number m such that n-m is also 3-smooth, a(n)=0 if no such 3-smooth number exists.
- Numbers having no representation as sum of two 3-smooth numbers.A081329
Numbers having no representation as sum of two 3-smooth numbers.
- Numbers that can be written as sum of two 3-smooth numbers.A081330
Numbers that can be written as sum of two 3-smooth numbers.
- Number of numbers <= n that can be written as sum of two 3-smooth numbers.A081331
Number of numbers <= n that can be written as sum of two 3-smooth numbers.
- Numbers having a unique partition into two 3-smooth numbers.A081332
Numbers having a unique partition into two 3-smooth numbers.
- Numbers having more than one partition into two 3-smooth numbers.A081333
Numbers having more than one partition into two 3-smooth numbers.
- a(n) = sigma(2*n^2) modulo 4.A081334
a(n) = sigma(2*n^2) modulo 4.
- a(n) = (6^n + 2^n)/2.A081335
a(n) = (6^n + 2^n)/2.
- a(n) = (7^n + 3^n)/2.A081336
a(n) = (7^n + 3^n)/2.
- a(n) = (8^n + 4^n)/2.A081337
a(n) = (8^n + 4^n)/2.
- a(n) = (9^n + 5^n)/2.A081338
a(n) = (9^n + 5^n)/2.
- Numbers n such that sigma(n^2) modulo 4 = 1.A081339
Numbers n such that sigma(n^2) modulo 4 = 1.
- (5^n+(-1)^n)/2.A081340
(5^n+(-1)^n)/2.
- Expansion of exp(3*x)*cosh(3*x).A081341
Expansion of exp(3*x)*cosh(3*x).
- a(n) = (8^n + 2^n)/2.A081342
a(n) = (8^n + 2^n)/2.
- a(n) = (10^n + 4^n)/2.A081343
a(n) = (10^n + 4^n)/2.
- Natural numbers in square maze arrangement, read by antidiagonals.A081344
Natural numbers in square maze arrangement, read by antidiagonals.
- First row in maze arrangement of natural numbers A081344.A081345
First row in maze arrangement of natural numbers A081344.
- First column in maze arrangement of natural numbers A081344.A081346
First column in maze arrangement of natural numbers A081344.
- First column in maze arrangement of natural numbers.A081347
First column in maze arrangement of natural numbers.
- First row in maze arrangement of natural numbers.A081348
First row in maze arrangement of natural numbers.
- Square maze arrangement of the natural numbers, read by antidiagonals.A081349
Square maze arrangement of the natural numbers, read by antidiagonals.
- First column in maze array of natural numbers A081349.A081350
First column in maze array of natural numbers A081349.
- First row in square maze array of natural numbers A081349.A081351
First row in square maze array of natural numbers A081349.
- Main diagonal of square maze arrangement of natural numbers A081349.A081352
Main diagonal of square maze arrangement of natural numbers A081349.
- Diagonal of square maze arrangement of natural numbers A081349.A081353
Diagonal of square maze arrangement of natural numbers A081349.
- Numbers k such that sigma(k^2) modulo 4 = 3.A081354
Numbers k such that sigma(k^2) modulo 4 = 3.
- Levenshtein distance between n and n^2 in decimal representation.A081355
Levenshtein distance between n and n^2 in decimal representation.
- Least m such that A081355(m)=LD(m,m^2)=n, where LD(x,y) denotes the Levenshtein distance between x and y in decimal representation.A081356
Least m such that A081355(m)=LD(m,m^2)=n, where LD(x,y) denotes the Levenshtein distance between x and y in decimal representation.
- Sublime numbers, numbers for which the number of divisors and the sum of the divisors are both perfect.A081357
Sublime numbers, numbers for which the number of divisors and the sum of the divisors are both perfect.
- E.g.f.: log((1+x) / (1-x)) / (2*(1-x)).A081358
E.g.f.: log((1+x) / (1-x)) / (2*(1-x)).
- Problem 49 on page 235 of Mathematics: California Edition, by Carole Greenes et al.A081359
Problem 49 on page 235 of Mathematics: California Edition, by Carole Greenes et al.
- Expansion of q^(-1/24) (m (1-m) / 16)^(1/24) in powers of q, where m = k^2 is the parameter and q is the nome for Jacobian elliptic functions.A081360
Expansion of q^(-1/24) (m (1-m) / 16)^(1/24) in powers of q, where m = k^2 is the parameter and q is the nome for Jacobian elliptic functions.