Search: seq:1,1,0,1,3,0,1,9,8,0
|
|
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 2 character edits (insertions, deletions, or replacements) away from the query.
- A059282 Number of symmetric trivalent (or cubic) connected graphs on 2n nodes (the Foster census).
(1, 1, 0, 1, 3, 0, 1, 1, 1, 0)
- A065623 a(n) = floor(abs(cos(n)/cos(2n))).
(1, 1, 0, 1, 3, 0, 1, 8, 0)
- A079275 Number of divisors of n that are semiprimes with distinct factors.
(1, 1, 0, 1, 3, 0, 1, 1, 3, 0)
- A091430 Number of Hamiltonian symmetric trivalent (or cubic) connected graphs on 2n nodes (the Foster census).
(1, 1, 0, 1, 3, 0, 1, 1, 1, 0)
- A157391 A partition product of Stirling_1 type [parameter k = 1] with biggest-part statistic (triangle read by rows).
(1, 1, 1, 1, 3, 0, 1, 9, 0, 0)
- ... 14 total
| |
| |
| | Transformations to other sequences
| |
|
These sequences match transformations of the original query.
a(n), dropping leading 0s and 1s
= 3, 0, 1, 9, 8, 0
- A358516 Decimal expansion of Sum_{k >= 1} (-1)^(k+1)*1/((k+2)*(k+3)).
(3, 0, 1, 9, 8, 0)
deltas matching: a(n), dropping leading 0s and 1s
= 3, 0, 1, 9, 8, 0
- A050379 Number of ordered factorizations of n into members of A050376.
(5, 2, 2, 1, 10, 2, 2)
- A337525 a(n) = Sum_{d1|n, d2|n, d1<d2} [omega(d1) = omega(d2)], where omega is the number of distinct prime factors of n (A001221) and [ ] is the Iverson bracket.
(4, 1, 1, 0, 9, 1, 1)
deltas matching: a(n)+1, after dropping leading 0s and 1s
= 4, 1, 2, 10, 9, 1
- A108501 Number of factorizations of 4*n into even numbers.
(7, 3, 4, 2, 12, 3, 4)
- A129320 a(n) = A129319(n)/A129318(n).
(6, 2, 3, 1, 11, 2, 1)
a(n)-1, after dropping leading 0s and 1s
= 2, -1, 0, 8, 7, -1
- A093086 "Fibonacci in digits": start with a(0)=0, a(1)=1; repeatedly adjoin the digits of the sum of the next two terms.
(2, 1, 0, 8, 7, 1)
deltas matching: a(n)-1, after dropping leading 0s and 1s
= 2, 1, 0, 8, 7, 1
- A073010 Decimal expansion of Pi/sqrt(27).
(9, 7, 8, 8, 0, 7, 8)
- A108380 Least number of distinct n-th roots of unity summing to the smallest possible nonzero magnitude.
(17, 15, 14, 14, 22, 15, 16)
- A130314 A051731 * A126705.
(2, 0, 1, 1, 9, 2, 1)
- A286127 Decimal expansion of Sum_{n>=1} A285388(n-1)/A285388(n).
(0, 2, 1, 1, 9, 2, 1)
a(n) for odd n
= 1, 0, 3, 1, 8
- A005295 Representation degeneracies for Neveu-Schwarz strings.
(1, 0, 3, 1, 8)
- A007023 Number of 4-connected 4-regular polyhedra with n nodes.
(1, 0, 3, 1, 8)
- A077897 Expansion of (1-x)^(-1)/(1+x-2*x^2-x^3).
(1, 0, 3, -1, 8)
- A127950 a(n) = A007376(8*n+2).
(1, 0, 3, 1, 8)
- A143347 Decimal expansion of the paper-folding constant, or the dragon constant.
(1, 0, 3, 1, 8)
- ... 15 total
deltas matching: a(n) for odd n
= 1, 0, 3, 1, 8
- A005013 a(n) = 3*a(n-2) - a(n-4), a(0)=0, a(1)=1, a(2)=1, a(3)=4. Alternates Fibonacci (A000045) and Lucas (A000032) sequences for even and odd n.
(0, 1, 1, 4, 3, 11)
- A005672 a(n) = Fibonacci(n+1) - 2^floor(n/2).
(0, 1, 1, 4, 5, 13)
- A019633 Decimal expansion of sqrt(2*Pi*e).
(4, 5, 5, 2, 1, 9)
- A028410 Number of types of Boolean functions of n variables under a certain group.
(1, 2, 2, 5, 6, 14)
- A031324 Decimal digits of successive Fibonacci numbers.
(4, 5, 5, 8, 9, 1)
- ... 28 total
a(n) for even n
= 1, 1, 0, 9, 0
- A019658 Decimal expansion of sqrt(Pi*e)/14.
(1, 1, 0, 9, 0)
- A020789 Decimal expansion of 1/sqrt(32).
(1, 1, 0, 9, 0)
- A059058 Card-matching numbers (Dinner-Diner matching numbers).
(1, 1, 0, 9, 0)
- A059064 Card-matching numbers (Dinner-Diner matching numbers).
(1, 1, 0, 9, 0)
- A069023 Define a subset of divisors of n to be a dedicated subset if the product of any two members is also a divisor of n. 1 is not allowed as a member as it gives trivially 1*d = d a divisor. a(n) is the number of dedicated subsets of divisors of n with at least two members.
(1, 1, 0, 9, 0)
- ... 32 total
deltas matching: a(n) for even n
= 1, 1, 0, 9, 0
- A049877 a(n) = max(j,k), where u(n) = u(j) + u(k) is the unique sum of Ulam numbers described in A002859 (with 1 <= j < k < n).
(34, 35, 36, 36, 27, 27)
- A078401 Triangle read by rows: T(n,k) = number of numbers <= k that are coprime to n, 1 <= k <= n.
(8, 9, 10, 10, 1, 1)
- A083202 a(n) = gcd(A000055(n), A000055(n+1)).
(1, 2, 1, 1, 10, 10)
- A093336 Second digit of prime(n).
(7, 8, 9, 9, 0, 0)
- A093337 Penultimate digits of the primes.
(7, 8, 9, 9, 0, 0)
- ... 20 total
abs(a(n)), sorted with duplicates removed
= 0, 1, 3, 8, 9
- A011067 Decimal expansion of 4th root of 75.
(0, 1, 3, 8, 9)
- A020799 Decimal expansion of 1/sqrt(42).
(0, 1, 3, 8, 9)
- A047472 Numbers that are congruent to {0, 1, 3} (mod 8).
(0, 1, 3, 8, 9)
- A087042 Decimal expansion of a number x such that adding Pi to each of the partial quotients of the continued fraction of x evaluates to x+3.
(0, 1, 3, 8, 9)
- A097665 Decimal expansion of the constant 4*exp(psi(1/4) + EulerGamma), where EulerGamma is the Euler-Mascheroni constant (A001620) and psi(x) is the digamma function.
(0, 1, 3, 8, 9)
- ... 21 total
deltas matching: abs(a(n)), sorted with duplicates removed
= 0, 1, 3, 8, 9
- A021393 Decimal expansion of 1/389.
(6, 6, 5, 8, 0, 9)
- A105643 Decimal expansion of e+Pi+e*Pi+e^Pi+Pi^e.
(6, 6, 5, 8, 0, 9)
- A114376 A modified Trott constant.
(3, 3, 4, 1, 9, 0)
- A128097 Triangle read by rows: T(n,k) is the number of Motzkin paths of length n and having k steps that touch the x-axis (1<=k<=n).
(4, 4, 5, 8, 0, 9)
- A132714 Decimal expansion of 24/Pi.
(5, 5, 4, 1, 9, 0)
- ... 7 total
|
Search completed in 1.052 seconds
|
