Search: seq:1,1,1,1,4,1,1,7,11,1
|
|
Sorry, but the terms do not match anything in the table.
The following advanced matches exist for the numeric terms in your query.
If your sequence is of general interest, please submit it using the form provided and it will (probably) be added to the OEIS! Include a brief description and if possible enough terms to fill 3 lines on the screen. We need at least 4 terms.
|
| |
| |
| |
|
|
| |
| |
| | Approximate matches
| |
|
These sequences are 1 character edit (insertion, deletion, or replacement) away from the query.
- A046550 First numerator and then denominator of the elements to the right of the central elements of the 1/3-Pascal triangle (by row), excluding 3's.
(1, 1, 1, 1, 4, 1, 1, 7, 1, 1)
- A046554 First denominator and then numerator of each element to the right of the central elements of the 1/3-Pascal triangle (by row), excluding 3's.
(1, 1, 1, 1, 4, 1, 1, 7, 1, 1)
- A112492 Triangle from inverse scaled Pochhammer symbols.
(1, 1, 1, 1, 3, 1, 1, 7, 11, 1)
- A113196 a(n) = F(n)/product{p=primes} F(p^(m_{n,p})), where p^(m_{n,p}) is highest power of p dividing n, m= nonnegative integer and F(k) is the k-th Fibonacci number.
(1, 1, 1, 1, 4, 1, 1, 1, 11, 1)
- A119673 T(n, k) = 3*T(n-1, k-1) + T(n-1, k) for k < n and T(n, n) = 1, T(n, k) = 0, if k < 0 or k > n; triangle read by rows.
(1, 1, 1, 1, 4, 1, 1, 7, 13, 1)
- ... 11 total
| |
| |
| | Overlapping matches
| |
|
These sequences have significant overlap with the query.
- A368884 The largest unitary divisor of n that is the square of a squarefree number (A062503).
(1, 1, 1, 1, 4, 1, 1)
| |
| |
| | Transformations to other sequences
| |
|
These sequences match transformations of the original query.
a(n)-1, after dropping leading 0s and 1s
= 3, 0, 0, 6, 10, 0
- A178516 Triangle read by rows: T(n,k) is the number of up-down permutations of {1,2,...,n} having genus k (see first comment for definition of genus).
(3, 0, 0, 6, 10, 0)
deltas matching: a(n)-1, after dropping leading 0s and 1s
= 3, 0, 0, 6, 10, 0
- A349543 a(n) = A001414(A277272(n)).
(6, 9, 9, 9, 15, 5, 5)
a(n) for odd n
= 1, 1, 4, 1, 11
- A013695 Continued fraction for zeta(19).
(1, 1, 4, 1, 11)
- A091156 Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n, having k long ascents (i.e., ascents of length at least 2). Rows are of length 1,1,2,2,3,3,... .
(1, 1, 4, 1, 11)
- A094503 Triangle read by rows: coefficients d(n,k) of Andre polynomials D(x,n) = Sum_{k>0} d(n,k)*x^k.
(1, 1, 4, 1, 11)
- A097322 (2n)! divided by denominator of Taylor expansion of exp(cos(x)-1).
(1, 1, 4, 1, 11)
- A109088 Taylor series of 1/f(x) with recursively defined function f(x) from A109087.
(-1, -1, 4, -1, -11)
- ... 22 total
deltas matching: a(n) for odd n
= 1, 1, 4, 1, 11
- A023760 Nialpdromes: digits in base 4 are in nonincreasing order.
(14, 15, 16, 20, 21, 32)
- A031999 Numbers whose base-4 digits are in nonincreasing order.
(14, 15, 16, 20, 21, 32)
- A057100 Hypotenuses of Pythagorean triangles (ordered by the product of the sides).
(25, 26, 25, 29, 30, 41)
- A065625 Table of permutations of N, each row being a generator of the "rotation group" of infinite planar binary tree. Inverse generators are given in A065626.
(3, 2, 1, 5, 4, 15)
- A069784 Numbers m such that gcd(d((m!)^3), d(m!)) = 2^k, i.e., is a power of 2; d = A000005.
(12, 13, 14, 18, 19, 30)
- ... 17 total
a(n) for even n
= 1, 1, 1, 7, 1
- A000688 Number of Abelian groups of order n; number of factorizations of n into prime powers.
(1, 1, 1, 7, 1)
- A001492 Clock chimes with a quarter-hour bell.
(1, 1, 1, 7, 1)
- A006085 Continued fraction for e/4.
(1, 1, 1, 7, 1)
- A010214 Continued fraction for sqrt(166).
(1, 1, 1, 7, 1)
- A010250 Continued fraction for cube root of 20.
(1, 1, 1, 7, 1)
- ... 576 total
deltas matching: a(n) for even n
= 1, 1, 1, 7, 1
- A002260 Triangle read by rows: T(n,k) = k for n >= 1, k = 1..n.
(5, 6, 7, 8, 1, 2)
- A002262 Triangle read by rows: T(n,k) = k, 0 <= k <= n, in which row n lists the first n+1 nonnegative integers.
(4, 5, 6, 7, 0, 1)
- A002389 Decimal expansion of -log(gamma), where gamma is Euler's constant A001620.
(9, 8, 9, 8, 1, 2)
- A004201 Accept one, reject one, accept two, reject two, ...
(33, 34, 35, 36, 43, 44)
- A004202 Skip 1, take 1, skip 2, take 2, skip 3, take 3, etc.
(27, 28, 29, 30, 37, 38)
- ... 988 total
multiples of: a(n) for even n
= 1, 1, 1, 7, 1
- A010141 Continued fraction for sqrt(55).
(2, 2, 2, 14, 2)
- A016463 Continued fraction for log(35).
(2, 2, 2, 14, 2)
- A066977 a(n) = gcd(prime(n^2) + 1, prime(n) + 1).
(2, 2, 2, 14, 2)
- A073203 Array of max. cycle length sequences for the table A073200.
(2, 2, 2, 14, 2)
- A088680 a(n) = prime(2n+1) - prime(2n).
(2, 2, 2, 14, 2)
- ... 26 total
abs(a(n)), sorted with duplicates removed
= 1, 4, 7, 11
- A002852 Continued fraction for Euler's constant (or Euler-Mascheroni constant) gamma.
(1, 4, 7, 11)
- A002974 Number of restricted solid partitions of n.
(1, 4, 7, 11)
- A011794 Triangle defined by a(n+1,k)=a(n,k-1)+a(n-1,k), a(n,1)=1, a(1,k)=1, a(2,k)=min(2,k).
(1, 4, 7, 11)
- A023666 Convolution of A000201 and A014306.
(1, 4, 7, 11)
- A028373 Numbers that have only the straight digits {1, 4, 7}.
(1, 4, 7, 11)
- ... 120 total
deltas matching: abs(a(n)), sorted with duplicates removed
= 1, 4, 7, 11
- A000135 Number of partitions into non-integral powers.
(1, 2, 6, 13, 24)
- A003600 Maximal number of pieces obtained by slicing a torus (or a bagel) with n cuts: (n^3 + 3*n^2 + 8*n)/6 (n > 0).
(1, 2, 6, 13, 24)
- A024477 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = A014306.
(5, 4, 8, 15, 26)
- A027957 a(n) = greatest number in row n of array T given by A027948.
(2, 3, 7, 14, 25)
- A039040 Numbers whose base-7 representation has the same number of 2's and 3's.
(96, 97, 101, 108, 119)
- ... 41 total
multiples of: abs(a(n)), sorted with duplicates removed
= 1, 4, 7, 11
- A121054 Sizes of successive clusters in f.c.c. lattice centered at a tetrahedral hole.
(4, 16, 28, 44)
- A121055 Sizes of successive clusters in b.c.c. lattice centered at midpoint of a short edge.
(2, 8, 14, 22)
- A211873 Numbers b >= 0 such that 2 b^2 + 3 b + 5 is prime.
(2, 8, 14, 22)
- A248057 Positions of 1,1 in the Thue-Morse sequence (A010060).
(2, 8, 14, 22)
|
Search completed in 0.606 seconds
|
