Sequences
392,541 sequences
- a(n) = 4*a(n-1) + 1, a(1)=7.A072261
a(n) = 4*a(n-1) + 1, a(1)=7.
- a(n) = 4*a(n-1) + 1, a(1)=11.A072262
a(n) = 4*a(n-1) + 1, a(1)=11.
- a(n) = 3*a(n-1) + 5*a(n-2), with a(0)=2, a(1)=3.A072263
a(n) = 3*a(n-1) + 5*a(n-2), with a(0)=2, a(1)=3.
- a(n) = 3*a(n-1) + 5*a(n-2), with a(0)=1, a(1)=1.A072264
a(n) = 3*a(n-1) + 5*a(n-2), with a(0)=1, a(1)=1.
- Variant of Lucas numbers: a(n) = a(n-1) + 4*a(n-2) starting with a(0)=2 and a(1)=1.A072265
Variant of Lucas numbers: a(n) = a(n-1) + 4*a(n-2) starting with a(0)=2 and a(1)=1.
- Number of words of length 2n generated by the two letters s and t that reduce to the identity 1 using the relations sssssss=1, tt=1 and stst=1. The generators s and t along with the three relations generate the 14-element dihedral group D7.A072266
Number of words of length 2n generated by the two letters s and t that reduce to the identity 1 using the relations sssssss=1, tt=1 and stst=1. The generators s and t along with the three relations generate the 14-element dihedral group D7.
- Duplicate of A024934.A072267
Duplicate of A024934.
- a(0)=1; a(n+1) = 1 + f(a(n))^2, where f(x) is the largest prime factor of x (A006530).A072268
a(0)=1; a(n+1) = 1 + f(a(n))^2, where f(x) is the largest prime factor of x (A006530).
- Smallest factorial containing exactly n 3's.A072269
Smallest factorial containing exactly n 3's.
- A partial product representation of A006131 and A072265.A072270
A partial product representation of A006131 and A072265.
- A partial product representation of f(n) = A015523(n) and L(n) = A072263(n).A072271
A partial product representation of f(n) = A015523(n) and L(n) = A072263(n).
- Number of active cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 614", based on the 5-celled von Neumann neighborhood.A072272
Number of active cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 614", based on the 5-celled von Neumann neighborhood.
- Index of powers of 2 that equal the number of noncongruent roots to the congruence x^2 == k (mod n) for (k,n)=1 and assuming solvability.A072273
Index of powers of 2 that equal the number of noncongruent roots to the congruence x^2 == k (mod n) for (k,n)=1 and assuming solvability.
- List of Ormiston prime pairs.A072274
List of Ormiston prime pairs.
- Least m such that one less than m-th prime has n divisors (or 0 if no such prime exists).A072275
Least m such that one less than m-th prime has n divisors (or 0 if no such prime exists).
- Strong pseudoprimes to bases 2 and 3.A072276
Strong pseudoprimes to bases 2 and 3.
- Smallest integer > 1 which is both n-gonal and centered n-gonal.A072277
Smallest integer > 1 which is both n-gonal and centered n-gonal.
- Numbers n such that phi(n) is the sum of the first k divisors of n for some k.A072278
Numbers n such that phi(n) is the sum of the first k divisors of n for some k.
- Dimension of n-th graded section of a certain Lie algebra.A072279
Dimension of n-th graded section of a certain Lie algebra.
- Product representation of the Pell numbers A000129 and A002203.A072280
Product representation of the Pell numbers A000129 and A002203.
- Numbers n such that phi(n) + 1 and phi(n) - 1 are twin primes.A072281
Numbers n such that phi(n) + 1 and phi(n) - 1 are twin primes.
- Numbers n such that sigma(n) + 1 and sigma(n) - 1 are twin primes.A072282
Numbers n such that sigma(n) + 1 and sigma(n) - 1 are twin primes.
- Number of raised dots to represent n in Braille.A072283
Number of raised dots to represent n in Braille.
- Numbers k begins a new chain of squarefree integers. I.e., k is squarefree but k-1 is not.A072284
Numbers k begins a new chain of squarefree integers. I.e., k is squarefree but k-1 is not.
- Numerators of inverse unimodal analog of binomial coefficients: binomial(n,m) = Sum_{k=0..n-m} a(2*k+m-1, 2*k).A072285
Numerators of inverse unimodal analog of binomial coefficients: binomial(n,m) = Sum_{k=0..n-m} a(2*k+m-1, 2*k).
- Denominators of inverse unimodal analog of binomial coefficients: binomial(n,m) = Sum_{k=0..n-m} a(2*k+m-1, 2*k).A072286
Denominators of inverse unimodal analog of binomial coefficients: binomial(n,m) = Sum_{k=0..n-m} a(2*k+m-1, 2*k).
- Let f(n, m) = binomial(n - m/2 + 1, n - m + 1) - binomial(n - m/2, n - m + 1) and let s(n) = Sum_{k=0..n} f(n, k); then a(n) = numerator of s(n).A072287
Let f(n, m) = binomial(n - m/2 + 1, n - m + 1) - binomial(n - m/2, n - m + 1) and let s(n) = Sum_{k=0..n} f(n, k); then a(n) = numerator of s(n).
- Smallest prime factor of googolplex + n that exceeds 13, or 1 if googolplex + n is 13-smooth.A072288
Smallest prime factor of googolplex + n that exceeds 13, or 1 if googolplex + n is 13-smooth.
- One eighty-fourth the area of primitive Pythagorean triangles with (increasing) square hypotenuses (precisely those of A008846).A072289
One eighty-fourth the area of primitive Pythagorean triangles with (increasing) square hypotenuses (precisely those of A008846).
- Number of digits in the decimal expansion of the Champernowne constant that must be scanned to encounter all n-digit strings.A072290
Number of digits in the decimal expansion of the Champernowne constant that must be scanned to encounter all n-digit strings.
- a(n) = a(n-1)+a(n-2)^n with a(1) = a(2) = 1.A072291
a(n) = a(n-1)+a(n-2)^n with a(1) = a(2) = 1.
- Number of proper powers b^d <= n (b > 1, d > 1).A072292
Number of proper powers b^d <= n (b > 1, d > 1).
- Smallest factorial containing exactly n 2's.A072293
Smallest factorial containing exactly n 2's.
- Areas of primitive Heronian triangles sorted by longest side, then by middle side and finally shortest side.A072294
Areas of primitive Heronian triangles sorted by longest side, then by middle side and finally shortest side.
- Smallest factorial containing exactly n 1's.A072295
Smallest factorial containing exactly n 1's.
- Least number starting a chain of exactly n consecutive even integers that do not have cototient-inverses.A072296
Least number starting a chain of exactly n consecutive even integers that do not have cototient-inverses.
- Number of even non-cototients not exceeding 2^n.A072297
Number of even non-cototients not exceeding 2^n.
- Smallest integer k such that for no integer m, m! is divisible by n^k but not by n^(k+1).A072298
Smallest integer k such that for no integer m, m! is divisible by n^k but not by n^(k+1).
- Numbers k such that reverse(k) is a prime factor of k.A072299
Numbers k such that reverse(k) is a prime factor of k.
- Number of positive integers not exceeding n that are relatively prime to reverse(n).A072300
Number of positive integers not exceeding n that are relatively prime to reverse(n).
- Number of positive integers not exceeding n that are relatively prime to sigma(n).A072301
Number of positive integers not exceeding n that are relatively prime to sigma(n).
- Number of positive integers not exceeding n that are relatively prime to phi(n).A072302
Number of positive integers not exceeding n that are relatively prime to phi(n).
- Numbers n for which n is congruent to n^2 mod phi(n).A072303
Numbers n for which n is congruent to n^2 mod phi(n).
- a(n)-th Fibonacci number is the smallest Fibonacci number containing exactly n 0's.A072304
a(n)-th Fibonacci number is the smallest Fibonacci number containing exactly n 0's.
- a(n)-th Fibonacci number is the smallest Fibonacci number containing exactly n 1's.A072305
a(n)-th Fibonacci number is the smallest Fibonacci number containing exactly n 1's.
- a(n)-th Fibonacci number is the smallest Fibonacci number containing exactly n 2's.A072306
a(n)-th Fibonacci number is the smallest Fibonacci number containing exactly n 2's.
- a(n)-th Fibonacci number is the smallest Fibonacci number containing exactly n 3's.A072307
a(n)-th Fibonacci number is the smallest Fibonacci number containing exactly n 3's.
- a(n)-th Fibonacci number is the smallest Fibonacci number containing exactly n 4's.A072308
a(n)-th Fibonacci number is the smallest Fibonacci number containing exactly n 4's.
- a(n)-th Fibonacci number is the smallest Fibonacci number containing exactly n 5's.A072309
a(n)-th Fibonacci number is the smallest Fibonacci number containing exactly n 5's.
- a(n)-th Fibonacci number is the smallest Fibonacci number containing exactly n 6's.A072310
a(n)-th Fibonacci number is the smallest Fibonacci number containing exactly n 6's.