login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Search: seq:0,1,0,0,2,2,0,0,0,16

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.
  • A062275 Array A(n, k) = n^k * k^n, n, k >= 0, read by antidiagonals.
    (0, 1, 0, 0, 2, 2, 0, 0, 3, 16)
  • A196078 T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 0,3,2,1,4 for x=0,1,2,3,4
    (0, 1, 0, 0, 2, 2, 0, 0, 0, 1)
  • A334109 a(n) = A329697(A225546(n)).
    (0, 1, 0, 0, 2, 2, 0, 0, 0, 1)
  • A354058 Square array read by ascending antidiagonals: T(n,k) is the number of degree-k primitive Dirichlet characters modulo n.
    (0, 1, 0, 0, 2, 2, 0, 0, 0, 1)
  • A374355 a(n) is the least fibbinary number f <= n such that n - f is also a fibbinary number whose binary expansion has no common 1's with that of f (where fibbinary numbers correspond to A003714).
    (0, 1, 0, 0, 2, 2, 0, 0, 0, 1)
Overlapping matches
These sequences have significant overlap with the query.
  • A035178 a(n) = Sum_{d|n} Kronecker(-12, d) (= A134667(d)).
    (0, 1, 0, 0, 2, 2, 0)
  • A113448 Expansion of (eta(q^2)^2 * eta(q^9) * eta(q^18)) / (eta(q) * eta(q^6)) in powers of q.
    (0, 1, 0, 0, 2, 2, 0)
Transformations to other sequences
These sequences match transformations of the original query.

deltas matching: a(n), dropping leading 0s and 1s = 2, 2, 0, 0, 0, 16
  • A211454 (p-1)/x, where p = prime(n) and x = ord(9,p), the smallest positive integer such that 9^x == 1 mod p.
    (2, 4, 2, 2, 2, 2, 18)
  • A346182 a(n) = A346463(n) / radical(A346463(n)).
    (1, 3, 1, 1, 1, 1, 17)
deltas matching: a(n)+1, after dropping leading 0s and 1s = 3, 3, 1, 1, 1, 17
  • A354126 Inverse permutation to A354125.
    (30, 33, 36, 37, 38, 39, 22)
a(n)-1, after dropping leading 0s and 1s = 1, 1, -1, -1, -1, 15
  • A010250 Continued fraction for cube root of 20.
    (1, 1, 1, 1, 1, 15)
  • A014491 a(n) = gcd(n, 2^n - 1).
    (1, 1, 1, 1, 1, 15)
  • A016464 Continued fraction for log(36).
    (1, 1, 1, 1, 1, 15)
  • A026835 Triangular array read by rows: T(n,k) = number of partitions of n into distinct parts in which every part is >=k, for k=1,2,...,n.
    (1, 1, 1, 1, 1, 15)
  • A055061 LCM of (2^d - 1) where d runs over the degrees of irreducible factors of x^n + x + 1 over GF(2), divided by A046932(n).
    (1, 1, 1, 1, 1, 15)
  • ... 64 total
deltas matching: a(n)-1, after dropping leading 0s and 1s = 1, 1, 1, 1, 1, 15
  • A004182 Omit 7's from n.
    (11, 12, 13, 14, 15, 16, 1)
  • A004448 Nimsum n + 7.
    (5, 4, 3, 2, 1, 0, 15)
  • A004449 Nimsum n + 8.
    (10, 11, 12, 13, 14, 15, 0)
  • A004464 Nimsum n + 23.
    (21, 20, 19, 18, 17, 16, 31)
  • A004465 Nimsum n + 24.
    (26, 27, 28, 29, 30, 31, 16)
  • ... 223 total
multiples of: a(n)-1, after dropping leading 0s and 1s = 1, 1, -1, -1, -1, 15
  • A056993 a(n) is the smallest k >= 2 such that k^(2^n)+1 is prime, or -1 if no such k exists.
    (2, 2, 2, 2, 2, 30)
  • A174209 In the sequence of natural numbers, moving left to right, delete 1st, 3rd, 5th, 7th etc occurrence of each of the ten digits.
    (2, 2, 2, 2, 2, 30)
  • A248774 Greatest k such that k^7 divides n!
    (24, 24, 24, 24, 24, 360)
a(n) for odd n = 0, 0, 2, 0, 0
  • A000086 Number of solutions to x^2 - x + 1 == 0 (mod n).
    (0, 0, 2, 0, 0)
  • A000089 Number of solutions to x^2 + 1 == 0 (mod n).
    (0, 0, 2, 0, 0)
  • A000091 Multiplicative with a(2^e) = 2 for k >= 1; a(3) = 2, a(3^e) = 0 for k >= 2; a(p^e) = 0 if p > 3 and p == -1 (mod 3); a(p^e) = 2 if p > 3 and p == 1 (mod 3).
    (0, 0, 2, 0, 0)
  • A000095 Number of fixed points of GAMMA_0 (n) of type i.
    (0, 0, 2, 0, 0)
  • A000122 Expansion of Jacobi theta function theta_3(x) = Sum_{m =-oo..oo} x^(m^2) (number of integer solutions to k^2 = n).
    (0, 0, 2, 0, 0)
  • ... 1990 total
deltas matching: a(n) for odd n = 0, 0, 2, 0, 0
  • A000586 Number of partitions of n into distinct primes.
    (9, 9, 9, 11, 11, 11)
  • A001299 Number of ways of making change for n cents using coins of 1, 5, 10, 25 cents.
    (2, 2, 2, 4, 4, 4)
  • A001300 Number of ways of making change for n cents using coins of 1, 5, 10, 25, 50 cents.
    (2, 2, 2, 4, 4, 4)
  • A001306 Number of ways of making change for n cents using coins of 1, 5, 10, 20, 50, 100 cents.
    (2, 2, 2, 4, 4, 4)
  • A001584 A generalized Fibonacci sequence.
    (2, 2, 2, 4, 4, 4)
  • ... 1507 total
a(n) for even n = 1, 0, 2, 0, 16
  • A009006 Expansion of e.g.f.: 1 + tan(x).
    (1, 0, 2, 0, 16)
  • A009045 Expansion of cos(sin(x))/exp(x).
    (-1, 0, 2, 0, -16)
  • A025600 Number of n-move knight paths on 8 X 8 board from given corner to same corner.
    (1, 0, 2, 0, 16)
  • A155585 a(n) = 2^n*E(n, 1) where E(n, x) are the Euler polynomials.
    (1, 0, -2, 0, 16)
  • A350972 E.g.f. = tan(x).
    (1, 0, 2, 0, 16)
  • ... 6 total
deltas matching: a(n) for even n = 1, 0, 2, 0, 16
  • A234018 Values at middle points of each row of A233270: a(n) = A233270(A233268(n)).
    (0, 1, 1, 3, 3, 19)
  • A240980 Numerators of f(n) with 2*f(n+1) = f(n) + A198631(n)/A006519(n+1), f(0)=0.
    (0, 1, 1, -1, -1, 15)
deltas matching: coefficients of 1/Sn(z) = 0, 0, 2, 2, 0, 4, 8, 12
Sn(z) denotes the ordinary generating function with coefficients a(n).
  • A083075 Square array read by antidiagonals: T(n,k) = (k*(2*k+3)^n + 1)/(k+1).
    (1, 1, 1, 3, 1, 1, 5, 13, 1)
  • A293796 Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f.: exp(Sum_{j>=1} j^(k-1)*A000041(j)*x^j).
    (1, 1, 1, 3, 1, 1, 5, 13, 1)
  • A335333 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of 1/sqrt(1 - 2*(2*k+1)*x + x^2).
    (1, 1, 1, 3, 1, 1, 5, 13, 1)
  • A341470 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = Sum_{j=0..n} binomial(k*n,n-j) * binomial(k*n+j,j).
    (1, 1, 1, 3, 1, 1, 5, 13, 1)
abs(a(n)), sorted with duplicates removed = 0, 1, 2, 16
  • A004831 Numbers that are the sum of at most 2 nonzero 4th powers.
    (0, 1, 2, 16)
  • A034507 Multiplicity of highest weight (or singular) vectors associated with character chi_119 of Monster module.
    (0, 1, 2, 16)
  • A045905 Catafusenes (see reference for precise definition).
    (0, 1, 2, 16)
  • A056662 Numbers k such that 90*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
    (0, 1, 2, 16)
  • A070654 a(n) = n^6 mod 31.
    (0, 1, 2, 16)
  • ... 23 total
deltas matching: abs(a(n)), sorted with duplicates removed = 0, 1, 2, 16
  • A003637 Number of classes per genus in quadratic field with discriminant -4n+1.
    (4, 4, 5, 3, 19)
  • A007111 Number of unlabeled graphs with n nodes and degree >= 3.
    (0, 0, 1, 3, 19)
  • A007112 Number of connected unlabeled graphs with n nodes and degree >= 3.
    (0, 0, 1, 3, 19)
  • A009291 Expansion of exp(x)/cos(tan(x)).
    (1, 1, 2, 4, 20)
  • A010290 Continued fraction for cube root of 61.
    (2, 2, 1, 3, 19)
  • ... 21 total
deltas matching: cumulative sum of a(n), ignoring leading 0s and 1s = 2, 4, 4, 4, 4, 20
  • A222304 Numbers n such that 2n is in A045980.
    (494, 496, 500, 504, 508, 512, 532)
  • A351623 Numbers k where 3k sets a record for the number of divisors of multiples of 3.
    (2, 4, 8, 12, 16, 20, 40)
multiples of: cumulative sum of a(n), ignoring leading 0s and 1s = 2, 4, 4, 4, 4, 20
  • A016502 Continued fraction for log(74).
    (1, 2, 2, 2, 2, 10)
  • A054481 Highest common factor of successive highly composite numbers (1), A002182.
    (6, 12, 12, 12, 12, 60)
  • A129279 a(0)=1. a(n) = the sum of the earlier terms which are <= n.
    (4, 8, 8, 8, 8, 40)
  • A139554 a(n) = lcm(1..floor(n/4)).
    (6, 12, 12, 12, 12, 60)
  • A217503 Squared distance between consecutive primes of the form 4k+1 (see below).
    (1, 2, 2, 2, 2, 10)
  • ... 10 total
deltas matching: a(n) / gcd, from the 3rd term = 0, 0, 1, 1, 0, 0, 0, 8
  • A242860 a(n) is the least k >= 2 such that k is neither a square modulo n nor a primitive root (mod n), or 0 if no such value exists.
    (2, 2, 2, 3, 2, 2, 2, 2, 10)
  • A249147 a(n) = 0 if A249148(n) = 1, otherwise the index of the least prime dividing A249148(n): a(n) = A055396(A249148(n)).
    (1, 1, 1, 2, 1, 1, 1, 1, 9)
  • A292254 a(n) = A292253(A163511(n)).
    (8, 8, 8, 9, 8, 8, 8, 8, 16)
a(n) / gcd, from the 4th term = 0, 1, 1, 0, 0, 0, 8
  • A038570 Second derivative of n.
    (0, 1, 1, 0, 0, 0, 8)
  • A094901 Positive integer values of the integer Schwarzian derivatives of the primes.
    (0, 1, 1, 0, 0, 0, 8)
deltas matching: a(n) / gcd, from the 4th term = 0, 1, 1, 0, 0, 0, 8
  • A093336 Second digit of prime(n).
    (7, 7, 8, 9, 9, 9, 9, 1)
  • A093337 Penultimate digits of the primes.
    (7, 7, 8, 9, 9, 9, 9, 1)
  • A093339 Middle digits of primes with an odd number of digits.
    (7, 7, 8, 9, 9, 9, 9, 1)
  • A210794 Triangle of coefficients of polynomials v(n,x) jointly generated with A210793; see the Formula section.
    (1, 1, 2, 3, 3, 3, 3, 11)
  • A292441 Largest m such that m^2 divides A000984(n).
    (2, 2, 3, 2, 2, 2, 2, 10)

Search completed in 0.641 seconds

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 11 17:12 EDT 2024. Contains 374234 sequences. (Running on oeis4.)