Sequences
392,541 sequences
- Limits of diagonals in triangle defined in A061260.A061261
Limits of diagonals in triangle defined in A061260.
- Smallest number representable as the sum of 3 triangular numbers in exactly n ways.A061262
Smallest number representable as the sum of 3 triangular numbers in exactly n ways.
- a(n) = floor(n^3/9).A061263
a(n) = floor(n^3/9).
- Number of cyclic permutations of the digits of n which give primes.A061264
Number of cyclic permutations of the digits of n which give primes.
- Number of squares between n-th prime and (n+1)st prime.A061265
Number of squares between n-th prime and (n+1)st prime.
- Number of squares between n^3 and (n+1)^3.A061266
Number of squares between n^3 and (n+1)^3.
- Squares whose sum of digits as well as product of digits is a nonzero square.A061267
Squares whose sum of digits as well as product of digits is a nonzero square.
- Numbers k such that k^2 has property that the sum of its digits and the product of its digits are nonzero squares.A061268
Numbers k such that k^2 has property that the sum of its digits and the product of its digits are nonzero squares.
- Squares with nonzero digits such that (1) each digit is a square and (2) the sum of the digits is a square.A061269
Squares with nonzero digits such that (1) each digit is a square and (2) the sum of the digits is a square.
- Squares such that each digit is a square and the sum of the digits is a square.A061270
Squares such that each digit is a square and the sum of the digits is a square.
- Duplicate of A061269.A061271
Duplicate of A061269.
- Squares such that (1) each digit is a square, (2) the sum of squares of the digits is a square.A061272
Squares such that (1) each digit is a square, (2) the sum of squares of the digits is a square.
- Number of primes between successive powers of e (= 2.718281828...).A061273
Number of primes between successive powers of e (= 2.718281828...).
- Number of primes between Pi^(n-1) and Pi^n.A061274
Number of primes between Pi^(n-1) and Pi^n.
- Smaller of two consecutive primes whose sum is a square.A061275
Smaller of two consecutive primes whose sum is a square.
- Numbers that are sums of repdigits of their digits (see Comments for precise definition).A061276
Numbers that are sums of repdigits of their digits (see Comments for precise definition).
- Numbers which have more different digits than their squares.A061277
Numbers which have more different digits than their squares.
- a(n) = 5*a(n-1) - 5*a(n-2) + a(n-3) with a(1) = 1 and a(k) = 0 if k <= 0.A061278
a(n) = 5*a(n-1) - 5*a(n-2) + a(n-3) with a(1) = 1 and a(k) = 0 if k <= 0.
- a(n) = Sum_{k >= 0} 2^k * binomial(k+2,n-2*k).A061279
a(n) = Sum_{k >= 0} 2^k * binomial(k+2,n-2*k).
- Smallest base b >= 2 for which b^n contains n as a substring.A061280
Smallest base b >= 2 for which b^n contains n as a substring.
- Side of n-th equilateral triangle enclosing at least one point located at integer distances from the vertices.A061281
Side of n-th equilateral triangle enclosing at least one point located at integer distances from the vertices.
- Minimal number of steps to get from 0 to n by (a) adding 1 or (b) multiplying by 3. A stopping problem: begin with n and at each stage if a multiple of 3 divide by 3, otherwise subtract 1.A061282
Minimal number of steps to get from 0 to n by (a) adding 1 or (b) multiplying by 3. A stopping problem: begin with n and at each stage if a multiple of 3 divide by 3, otherwise subtract 1.
- Smallest number with exactly 2n-1 divisors.A061283
Smallest number with exactly 2n-1 divisors.
- Duplicate of A016017.A061284
Duplicate of A016017.
- a(n) = 2^((prime(n) - 1)/2).A061285
a(n) = 2^((prime(n) - 1)/2).
- Smallest integer for which the number of divisors is the n-th prime.A061286
Smallest integer for which the number of divisors is the n-th prime.
- Integer part of square root of n-th Fibonacci number.A061287
Integer part of square root of n-th Fibonacci number.
- Integer part of square root of n-th triangular number.A061288
Integer part of square root of n-th triangular number.
- Consider a network of triangles consisting of an equilateral triangle divided into n^2 equilateral triangles plus a circle connecting the vertices of the main triangle. Sequence gives minimal number of corner turns required to trace the network in one continuous line.A061289
Consider a network of triangles consisting of an equilateral triangle divided into n^2 equilateral triangles plus a circle connecting the vertices of the main triangle. Sequence gives minimal number of corner turns required to trace the network in one continuous line.
- Square array read by antidiagonals of T(n,k) = T(n-1,k) + T(n-1, floor(k/2)) with T(0,0)=1.A061290
Square array read by antidiagonals of T(n,k) = T(n-1,k) + T(n-1, floor(k/2)) with T(0,0)=1.
- a(1) = 1; a(n+1) = a(1) + a(2)*(a(2) + a(3)*(a(3) +...+a(n-1)*(a(n-1) + a(n))...)).A061291
a(1) = 1; a(n+1) = a(1) + a(2)*(a(2) + a(3)*(a(3) +...+a(n-1)*(a(n-1) + a(n))...)).
- a(n) = a(n-1)*a(n-2)*a(n-3) - a(n-4) for n>3 with a(0) = a(1) = a(2) = a(3) = 2.A061292
a(n) = a(n-1)*a(n-2)*a(n-3) - a(n-4) for n>3 with a(0) = a(1) = a(2) = a(3) = 2.
- a(n) = floor( n^e ), e = 2.718281828...A061293
a(n) = floor( n^e ), e = 2.718281828...
- a(n) = floor( n^Pi ).A061294
a(n) = floor( n^Pi ).
- Minimal number of steps to get from 0 to n by (a) adding 1 or (b) subtracting 1 or (c) multiplying by 3.A061295
Minimal number of steps to get from 0 to n by (a) adding 1 or (b) subtracting 1 or (c) multiplying by 3.
- Row sums of A067050.A061296
Row sums of A067050.
- a(n) = Sum_{ r = 0 to n} L(n,r), where L(n,r) (A067049) = lcm(n, n-1, n-2, ..., n-r+1)/lcm(1, 2, 3, ..., r).A061297
a(n) = Sum_{ r = 0 to n} L(n,r), where L(n,r) (A067049) = lcm(n, n-1, n-2, ..., n-r+1)/lcm(1, 2, 3, ..., r).
- Table by antidiagonals of rows of sequences where each row is binomial transform of preceding row and row 1 is (1,2,1,2,1,2,1,2,...).A061298
Table by antidiagonals of rows of sequences where each row is binomial transform of preceding row and row 1 is (1,2,1,2,1,2,1,2,...).
- Least number whose number of divisors is A007304(n) (the n-th number that is the product of 3 distinct primes).A061299
Least number whose number of divisors is A007304(n) (the n-th number that is the product of 3 distinct primes).
- Least number whose number of divisors is n!.A061300
Least number whose number of divisors is n!.
- a(n) = 2^(n*2^(n-1)).A061301
a(n) = 2^(n*2^(n-1)).
- a(n) = n! * [x^n] W(-x)*(W(-x) + 2)/(W(-x) + 1), where W denotes Lambert's W function.A061302
a(n) = n! * [x^n] W(-x)*(W(-x) + 2)/(W(-x) + 1), where W denotes Lambert's W function.
- Given a prime p, let s(p,0)=p and let s(p,n+1) be the smallest prime == 1 (mod s(p,n)). Let S(p) be the sequence {s(p,n): n=0,1,...}. Let a(0)=2 and let a(n+1) be the smallest prime not in any of the sequences S(a(0)), ..., S(a(n)).A061303
Given a prime p, let s(p,0)=p and let s(p,n+1) be the smallest prime == 1 (mod s(p,n)). Let S(p) be the sequence {s(p,n): n=0,1,...}. Let a(0)=2 and let a(n+1) be the smallest prime not in any of the sequences S(a(0)), ..., S(a(n)).
- Squarefree triangular numbers.A061304
Squarefree triangular numbers.
- Squarefree Fibonacci numbers.A061305
Squarefree Fibonacci numbers.
- Bell Bell numbers: a(n+1) = B(a(n)), where B() are the Bell numbers, A000110.A061306
Bell Bell numbers: a(n+1) = B(a(n)), where B() are the Bell numbers, A000110.
- Duplicate of A061300.A061307
Duplicate of A061300.
- Smaller of two consecutive primes whose sum is a cube.A061308
Smaller of two consecutive primes whose sum is a cube.
- a(n) is the smallest number required to make the concatenation of a(n) and 2n+1 a prime, or -1 if no such number exists.A061309
a(n) is the smallest number required to make the concatenation of a(n) and 2n+1 a prime, or -1 if no such number exists.
- Numbers which cannot be reached in the Countdown Numbers Game starting from (1,2,3,4,5,6): the game allows brackets and the operations + - x and / and not all numbers need be used, while the result of each partial calculation must be an integer.A061310
Numbers which cannot be reached in the Countdown Numbers Game starting from (1,2,3,4,5,6): the game allows brackets and the operations + - x and / and not all numbers need be used, while the result of each partial calculation must be an integer.