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,4,12,48,240,1440,10080,80640,725760

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.
  • A052849 a(0) = 0; a(n+1) = 2*n! (n >= 0).
    (0, 2, 4, 12, 48, 240, 1440, 10080, 80640, 725760)
Transformations to other sequences
These sequences match transformations of the original query.

a(n), dropping leading 0s and 1s = 4, 12, 48, 240, 1440, 10080, 80640, 725760
  • A052849 a(0) = 0; a(n+1) = 2*n! (n >= 0).
    (4, 12, 48, 240, 1440, 10080, 80640, 725760)
  • A066459 Product of factorials of the digits of n.
    (4, 12, 48, 240, 1440, 10080, 80640, 725760)
  • A098558 Expansion of e.g.f. (1+x)/(1-x).
    (4, 12, 48, 240, 1440, 10080, 80640, 725760)
  • A208529 Number of permutations of n > 1 having exactly 2 points on the boundary of their bounding square.
    (4, 12, 48, 240, 1440, 10080, 80640, 725760)
deltas matching: a(n), dropping leading 0s and 1s = 4, 12, 48, 240, 1440, 10080, 80640, 725760
  • A066237 First differences give A052849.
    (3, 7, 19, 67, 307, 1747, 11827, 92467, 818227)
multiples of: a(n), dropping leading 0s and 1s = 4, 12, 48, 240, 1440, 10080, 80640, 725760
  • A000142 Factorial numbers: n! = 1*2*3*4*...*n (order of symmetric group S_n, number of permutations of n letters).
    (2, 6, 24, 120, 720, 5040, 40320, 362880)
  • A001710 Order of alternating group A_n, or number of even permutations of n letters.
    (1, 3, 12, 60, 360, 2520, 20160, 181440)
  • A033647 Base 10 digital convolution sequence.
    (2, 6, 24, 120, 720, 5040, 40320, 362880)
  • A052560 a(n) = 3*n!.
    (6, 18, 72, 360, 2160, 15120, 120960, 1088640)
  • A052578 a(0) = 0, a(n) = 4*n! for n > 0.
    (8, 24, 96, 480, 2880, 20160, 161280, 1451520)
  • ... 89 total
a(n)+1, after dropping leading 0s and 1s = 5, 13, 49, 241, 1441, 10081, 80641, 725761
  • A052898 2*n! + 1.
    (5, 13, 49, 241, 1441, 10081, 80641, 725761)
a(n)-1, after dropping leading 0s and 1s = 3, 11, 47, 239, 1439, 10079, 80639, 725759
  • A020543 a(0) = 1, a(1) = 1, a(n+1) = (n+1)*a(n) + n.
    (3, 11, 47, 239, 1439, 10079, 80639, 725759)
e(n) = a(n) / (n-1)! = 0, 1, 2, 2, 2, 2, 2, 2, 2, 2
  • A008857 a(n) = floor(n/9)*ceiling(n/9).
    (0, 1, 2, 2, 2, 2, 2, 2, 2, 2)
  • A054054 Smallest digit of n.
    (0, 1, 2, 2, 2, 2, 2, 2, 2, 2)
  • A064601 a(n) = # { p | A064558(k) = p prime and k <= n}.
    (0, 1, 2, 2, 2, 2, 2, 2, 2, 2)
  • A065685 Number of primes <= prime(n) which begin with a 6.
    (0, 1, 2, 2, 2, 2, 2, 2, 2, 2)
  • A065687 Number of primes <= prime(n) which begin with an 8.
    (0, 1, 2, 2, 2, 2, 2, 2, 2, 2)
  • ... 25 total
deltas matching: e(n) = a(n) / (n-1)! = 0, 1, 2, 2, 2, 2, 2, 2, 2, 2
  • A014295 Inverse of 286th cyclotomic polynomial.
    (0, 0, 1, -1, 1, -1, 1, -1, 1, -1, 1)
  • A014383 Inverse of 374th cyclotomic polynomial.
    (0, 0, 1, -1, 1, -1, 1, -1, 1, -1, 1)
  • A014427 Inverse of 418th cyclotomic polynomial.
    (0, 0, 1, -1, 1, -1, 1, -1, 1, -1, 1)
  • A014451 Inverse of 442nd cyclotomic polynomial.
    (0, 0, 1, -1, 1, -1, 1, -1, 1, -1, 1)
  • A014503 Inverse of 494th cyclotomic polynomial.
    (0, 0, 1, -1, 1, -1, 1, -1, 1, -1, 1)
  • ... 91 total
multiples of: coefficients of 1 / En(z)^2 = 8, -12, 32, -120, 576, -3360, 23040
En(z) denotes the exponential generating function with coefficients a(n).
  • A001048 a(n) = n! + (n-1)!.
    (2, 3, 8, 30, 144, 840, 5760)
  • A301737 Denominator of cumulative weight of certain D-forests on n nodes.
    (2, 3, 8, 30, 144, 840, 5760)
multiples of: coefficients of 1 / En(z) = -2, 2, -4, 12, -48, 240, -1440, 10080
En(z) denotes the exponential generating function with coefficients a(n).
  • A033645 Base 8 digital convolution sequence.
    (1, 1, 2, 6, 24, 120, 720, 5040)
  • A033646 Base 9 digital convolution sequence.
    (1, 1, 2, 6, 24, 120, 720, 5040)
  • A045977 Smallest number with same number of divisors as n!.
    (1, 1, 2, 6, 24, 120, 720, 5040)
  • A067455 Let m be the product of the decimal digits in n, then a(n) = 0 if m = 0, otherwise a(n) = n!/m.
    (1, 1, 2, 6, 24, 120, 720, 5040)
  • A114796 Cumulative product of sextuple factorial A085158.
    (1, 1, 2, 6, 24, 120, 720, 5040)
  • ... 27 total
coefficients of En(z) * (1-z) / (1+z) = 0, 1, 0, 0, 0, 0, 0, 0, 0, 0
En(z) denotes the exponential generating function with coefficients a(n).
  • A003982 Table read by rows: 1 if x = y, 0 otherwise, where (x,y) = (0,0),(0,1),(1,0),(0,2),(1,1),(2,0),...
    (0, 1, 0, 0, 0, 0, 0, 0, 0, 0)
  • A003985 Triangle with subscripts (1,1),(2,1),(1,2),(3,1),(2,2),(1,3), etc. in which entry (i,j) is i AND j.
    (0, 1, 0, 0, 0, 0, 0, 0, 0, 0)
  • A004198 Table of x AND y, where (x,y) = (0,0),(0,1),(1,0),(0,2),(1,1),(2,0),...
    (0, 1, 0, 0, 0, 0, 0, 0, 0, 0)
  • A004530 Expansion of (theta_2(0, x) + theta_3(0, x) + theta_4(0, x)) / 2 in powers of x^(1/4).
    (0, 1, 0, 0, 0, 0, 0, 0, 0, 0)
  • A005369 a(n) = 1 if n is of the form m(m+1), else 0.
    (0, 1, 0, 0, 0, 0, 0, 0, 0, 0)
  • ... 1571 total
deltas matching: coefficients of En(z) * (1-z) / (1+z) = 0, 1, 0, 0, 0, 0, 0, 0, 0, 0
En(z) denotes the exponential generating function with coefficients a(n).
  • A000030 Initial digit of n.
    (1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2)
  • A000193 Nearest integer to log n.
    (2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3)
  • A000194 n appears 2n times, for n >= 1; also nearest integer to square root of n.
    (4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5)
  • A000195 a(n) = floor(log(n)).
    (1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2)
  • A000196 Integer part of square root of n. Or, number of positive squares <= n. Or, n appears 2n+1 times.
    (3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4)
  • ... 2356 total
e(n+1) - e(n), where e(n) = a(n) / (n-1)! = -1, -1, 0, 0, 0, 0, 0, 0, 0
  • A004555 Expansion of sqrt(5) in base 2.
    (1, 1, 0, 0, 0, 0, 0, 0, 0)
  • A004601 Expansion of Pi in base 2 (or, binary expansion of Pi).
    (1, 1, 0, 0, 0, 0, 0, 0, 0)
  • A011707 A binary m-sequence: expansion of reciprocal of x^8+x^7+x^6+x^4+x^2+x+1.
    (1, 1, 0, 0, 0, 0, 0, 0, 0)
  • A011712 A binary m-sequence: expansion of reciprocal of x^8+x^7+x^5+x^4+1.
    (1, 1, 0, 0, 0, 0, 0, 0, 0)
  • A011716 A binary m-sequence: expansion of reciprocal of x^8+x^7+x^6+x^5+x^4+x+1.
    (1, 1, 0, 0, 0, 0, 0, 0, 0)
  • ... 465 total
deltas matching: e(n+1) - e(n), where e(n) = a(n) / (n-1)! = 1, 1, 0, 0, 0, 0, 0, 0, 0
  • A003002 Size of the largest subset of the numbers [1...n] which does not contain a 3-term arithmetic progression.
    (14, 15, 16, 16, 16, 16, 16, 16, 16, 16)
  • A003892 Degrees of irreducible representations of group L2(32).
    (31, 32, 33, 33, 33, 33, 33, 33, 33, 33)
  • A003986 Table T(n,k) = n OR k read by antidiagonals.
    (5, 6, 7, 7, 7, 7, 7, 7, 7, 7)
  • A003989 Triangle T from the array A(x, y) = gcd(x,y), for x >= 1, y >= 1, read by antidiagonals.
    (3, 2, 1, 1, 1, 1, 1, 1, 1, 1)
  • A005087 Number of distinct odd primes dividing n.
    (1, 2, 1, 1, 1, 1, 1, 1, 1, 1)
  • ... 1497 total
e(n+2) - 2*e(n+1) + e(n), where e(n) = a(n) / (n-1)! = 0, -1, 0, 0, 0, 0, 0, 0
  • A004585 Expansion of sqrt(10) in base 2.
    (0, 1, 0, 0, 0, 0, 0, 0)
  • A004586 Expansion of sqrt(10) in base 3.
    (0, 1, 0, 0, 0, 0, 0, 0)
  • A004593 Expansion of e in base 2.
    (0, 1, 0, 0, 0, 0, 0, 0)
  • A004609 Expansion of sqrt(6) in base 2.
    (0, 1, 0, 0, 0, 0, 0, 0)
  • A005873 Theta series of hexagonal close-packing with respect to tetrahedral hole.
    (0, 1, 0, 0, 0, 0, 0, 0)
  • ... 611 total
deltas matching: e(n+2) - 2*e(n+1) + e(n), where e(n) = a(n) / (n-1)! = 0, 1, 0, 0, 0, 0, 0, 0
  • A000006 Integer part of square root of n-th prime.
    (15, 15, 16, 16, 16, 16, 16, 16, 16)
  • A000267 Integer part of square root of 4n+1.
    (12, 12, 13, 13, 13, 13, 13, 13, 13)
  • A000703 Chromatic number (or Heawood number) of nonorientable surface with n crosscaps.
    (21, 21, 22, 22, 22, 22, 22, 22, 22)
  • A001462 Golomb's sequence: a(n) is the number of times n occurs, starting with a(1) = 1.
    (15, 15, 16, 16, 16, 16, 16, 16, 16)
  • A002994 Initial digit of cubes.
    (1, 1, 2, 2, 2, 2, 2, 2, 2)
  • ... 630 total
-e(n+3) + 3*e(n+2) - 3*e(n+1) + e(n), where e(n) = a(n) / (n-1)! = 1, -1, 0, 0, 0, 0, 0
  • A000161 Number of partitions of n into 2 squares.
    (1, 1, 0, 0, 0, 0, 0)
  • A002904 Delete all letters except c, d, i, l, m, v, x from the English name of n, then read as Roman numeral if possible, otherwise 0.
    (1, 1, 0, 0, 0, 0, 0)
  • A003475 Expansion of Sum_{k>0} (-1)^(k+1) q^(k^2) / ((1-q)(1-q^3)(1-q^5)...(1-q^(2k-1))).
    (1, -1, 0, 0, 0, 0, 0)
  • A003988 Triangle with subscripts (1,1),(2,1),(1,2),(3,1),(2,2),(1,3), etc. in which entry (i,j) is [ i/j ].
    (1, 1, 0, 0, 0, 0, 0)
  • A004547 Expansion of sqrt(3) in base 2.
    (1, 1, 0, 0, 0, 0, 0)
  • ... 489 total
deltas matching: -e(n+3) + 3*e(n+2) - 3*e(n+1) + e(n), where e(n) = a(n) / (n-1)! = 1, 1, 0, 0, 0, 0, 0
  • A001319 Number of (unordered) ways of making change for n cents using coins of 2, 5, 10, 20, 50 cents.
    (1, 0, 1, 1, 1, 1, 1, 1)
  • A002637 Number of partitions of n into not more than 5 pentagonal numbers.
    (1, 2, 1, 1, 1, 1, 1, 1)
  • A003016 Number of occurrences of n as an entry in rows <= n of Pascal's triangle (A007318).
    (2, 3, 2, 2, 2, 2, 2, 2)
  • A003117 Continued fraction for fifth root of 3.
    (3, 2, 1, 1, 1, 1, 1, 1)
  • A003313 Length of shortest addition chain for n.
    (7, 6, 7, 7, 7, 7, 7, 7)
  • ... 1135 total
coefficients of En(z) / (1-z)^2 = 0, 1, 8, 54, 384, 3000, 25920, 246960, 2580480, 29393280
En(z) denotes the exponential generating function with coefficients a(n).
  • A002775 a(n) = n^2 * n!.
    (0, 1, 8, 54, 384, 3000, 25920, 246960, 2580480, 29393280)
e(n+1) + e(n), where e(n) = a(n) / (n-1)! = 1, 3, 4, 4, 4, 4, 4, 4, 4
  • A113311 Expansion of (1+x)^2/(1-x).
    (1, 3, 4, 4, 4, 4, 4, 4, 4)
  • A349992 Number of ways to write n as x^4 + y^2 + (z^2 + 2*4^w)/3, where x, y, z are nonnegative integers, and w is 0 or 1.
    (1, 3, 4, 4, 4, 4, 4, 4, 4)
deltas matching: e(n+1) + e(n), where e(n) = a(n) / (n-1)! = 1, 3, 4, 4, 4, 4, 4, 4, 4
  • A030589 Position of n-th 0 in A030588.
    (313, 314, 317, 321, 325, 329, 333, 337, 341, 345)
  • A031058 Position of n-th 0 in A031057.
    (746, 747, 750, 754, 758, 762, 766, 770, 774, 778)
  • A079042 Numbers n in which the first k digits of n form an integer divisible by k^2, for k = 1, 2, ..., m, where m is the number of digits in n.
    (8, 9, 12, 16, 20, 24, 28, 32, 36, 40)
  • A079238 Numbers n in which the last K digits of n form an integer divisible by K^2, for K = 1, 2, ..., M, where M is the number of digits in n.
    (8, 9, 12, 16, 20, 24, 28, 32, 36, 40)
  • A080708 a(1)=5; for n>1, a(n) = smallest number > a(n-1) such that the condition "n is in the sequence if and only if a(n) is a multiple of 4" is satisfied.
    (52, 53, 56, 60, 64, 68, 72, 76, 80, 84)
  • ... 16 total
multiples of: e(n+1) + e(n), where e(n) = a(n) / (n-1)! = 1, 3, 4, 4, 4, 4, 4, 4, 4
  • A363705 The minimum irregularity of all maximal 2-degenerate graphs with n vertices.
    (2, 6, 8, 8, 8, 8, 8, 8, 8)
deltas matching: e(n+2) + e(n), where e(n) = a(n) / (n-1)! = 2, 3, 4, 4, 4, 4, 4, 4
  • A113127 Expansion of (1 + x + x^2 + x^3)/(1-x)^2.
    (1, 3, 6, 10, 14, 18, 22, 26, 30)
  • A132211 Coefficients of a Ramanujan q-series.
    (1, -1, 2, -2, 2, -2, 2, -2, 2)
  • A139282 Form a sequence of words as follows: look to the left, towards the beginning of the sequence and write down the number of vowels you see; repeat; then replace the words with the corresponding numbers.
    (70, 72, 75, 79, 83, 87, 91, 95, 99)
  • A190035 Number of nondecreasing arrangements of n+2 numbers in 0..3 with the last equal to 3 and each after the second equal to the sum of one or two of the preceding three.
    (5, 7, 10, 14, 18, 22, 26, 30, 34)
  • A211516 Number of ordered triples (w,x,y) with all terms in {1,...,n} and w^2=x+y.
    (34, 36, 39, 43, 47, 51, 55, 59, 63)
  • ... 11 total
multiples of: e(n+2) + e(n), where e(n) = a(n) / (n-1)! = 2, 3, 4, 4, 4, 4, 4, 4
  • A038759 a(n) = ceiling(sqrt(n))*floor(sqrt(n)).
    (6, 9, 12, 12, 12, 12, 12, 12)
  • A244482 Second trisection of A240808.
    (6, 9, 12, 12, 12, 12, 12, 12)
  • A265525 a(n) = largest base-10 palindrome m <= n such that every base-10 digit of m is <= the corresponding digit of n.
    (22, 33, 44, 44, 44, 44, 44, 44)
  • A268241 Number of closed factors of length n in Thue-Morse sequence A010060.
    (16, 24, 32, 32, 32, 32, 32, 32)
  • A309195 a(n) = smallest number missing from A111273 after A111273(n) has been found.
    (4, 6, 8, 8, 8, 8, 8, 8)
e(n+2) + e(n+1) + e(n), where e(n) = a(n) / (n-1)! = 3, 5, 6, 6, 6, 6, 6, 6
  • A267884 Total number of OFF (white) cells after n iterations of the "Rule 233" elementary cellular automaton starting with a single ON (black) cell.
    (3, 5, 6, 6, 6, 6, 6, 6)
  • A374684 Sum of leaders of strictly increasing runs in the n-th composition in standard order.
    (3, 5, 6, 6, 6, 6, 6, 6)
deltas matching: e(n+2) + e(n+1) + e(n), where e(n) = a(n) / (n-1)! = 3, 5, 6, 6, 6, 6, 6, 6
  • A270545 Number of equilateral triangle units forming perimeter of equilateral triangle.
    (1, 4, 9, 15, 21, 27, 33, 39, 45)
  • A313295 Coordination sequence Gal.5.90.1 where Gal.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
    (1, 4, 9, 15, 21, 27, 33, 39, 45)
  • A313296 Coordination sequence Gal.6.209.1 where Gal.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
    (1, 4, 9, 15, 21, 27, 33, 39, 45)
  • A313297 Coordination sequence Gal.6.210.1 where Gal.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
    (1, 4, 9, 15, 21, 27, 33, 39, 45)
e(n+2) - e(n), where e(n) = a(n) / (n-1)! = 2, 1, 0, 0, 0, 0, 0, 0
  • A094247 Expansion of (phi(-q^5)^2 - phi(-q)^2) / 4 in powers of q where phi() is a Ramanujan theta function.
    (2, -1, 0, 0, 0, 0, 0, 0)
  • A106347 A generalized Fredholm-Rueppel sequence.
    (2, -1, 0, 0, 0, 0, 0, 0)
  • A115236 Matrix inverse of triangle A003983.
    (-2, 1, 0, 0, 0, 0, 0, 0)
  • A117901 Inverse of number triangle A117898.
    (-2, 1, 0, 0, 0, 0, 0, 0)
  • A120113 Bi-diagonal inverse of number triangle A120101.
    (-2, 1, 0, 0, 0, 0, 0, 0)
  • ... 11 total
deltas matching: e(n+2) - e(n), where e(n) = a(n) / (n-1)! = 2, 1, 0, 0, 0, 0, 0, 0
  • A000655 a(n) = number of letters in a(n-1), a(1) = 1 (in English).
    (3, 5, 4, 4, 4, 4, 4, 4, 4)
  • A003987 Table of n XOR m (or Nim-sum of n and m) read by antidiagonals with m>=0, n>=0.
    (4, 6, 7, 7, 7, 7, 7, 7, 7)
  • A005091 Number of distinct primes = 3 mod 4 dividing n.
    (0, 2, 1, 1, 1, 1, 1, 1, 1)
  • A027199 Triangular array T read by rows: T(n,k) = number of partitions of n into an odd number of parts, each >=k.
    (4, 2, 1, 1, 1, 1, 1, 1, 1)
  • A031350 4-multiplicative persistence: number of iterations of "multiply 4th powers of digits" needed to reach 0 or 1.
    (1, 3, 2, 2, 2, 2, 2, 2, 2)
  • ... 121 total
coefficients of En(z) / (1-z^2) = 0, 1, 4, 18, 96, 600, 4320, 35280, 322560, 3265920
En(z) denotes the exponential generating function with coefficients a(n).
  • A001563 a(n) = n*n! = (n+1)! - n!.
    (0, 1, 4, 18, 96, 600, 4320, 35280, 322560, 3265920)
  • A094304 Sum of all possible sums formed from all but one of the previous terms, starting 1.
    (0, 1, 4, 18, 96, 600, 4320, 35280, 322560, 3265920)
deltas matching: coefficients of En(z) / (1-z^2) = 0, 1, 4, 18, 96, 600, 4320, 35280, 322560, 3265920
En(z) denotes the exponential generating function with coefficients a(n).
  • A033312 a(n) = n! - 1.
    (0, 0, 1, 5, 23, 119, 719, 5039, 40319, 362879, 3628799)
  • A038507 a(n) = n! + 1.
    (2, 2, 3, 7, 25, 121, 721, 5041, 40321, 362881, 3628801)
  • A185387 E.g.f. exp(x)+log(1/(1-x)).
    (2, 2, 3, 7, 25, 121, 721, 5041, 40321, 362881, 3628801)
  • A261193 a(n) = n! - 2.
    (-1, -1, 0, 4, 22, 118, 718, 5038, 40318, 362878, 3628798)
e(n+2) - e(n+1) - e(n), where e(n) = a(n) / (n-1)! = 1, -1, -2, -2, -2, -2, -2, -2
  • A003642 Number of genera of imaginary quadratic field with discriminant -k, k = A191483(n).
    (1, 1, 2, 2, 2, 2, 2, 2)
  • A004052 The coding-theoretic function A(n,14,8).
    (1, 1, 2, 2, 2, 2, 2, 2)
  • A006460 Image of n after 3k iterates of '3x+1' map (k large).
    (1, 1, 2, 2, 2, 2, 2, 2)
  • A008350 Number of orbits of norm 2n vectors in E_8 lattice.
    (1, 1, 2, 2, 2, 2, 2, 2)
  • A012257 Irregular triangle read by rows: row 0 is {2}; if row n is {r_1, ..., r_k} then row n+1 is {r_k 1's, r_{k-1} 2's, r_{k-2} 3's, etc.}.
    (1, 1, 2, 2, 2, 2, 2, 2)
  • ... 119 total
deltas matching: e(n+2) - e(n+1) - e(n), where e(n) = a(n) / (n-1)! = 1, 1, 2, 2, 2, 2, 2, 2
  • A004271 1, 3 and the nonnegative even numbers.
    (2, 3, 4, 6, 8, 10, 12, 14, 16)
  • A004272 1, 3, 5 and the nonnegative even numbers.
    (4, 5, 6, 8, 10, 12, 14, 16, 18)
  • A004274 0, 2 and the odd numbers.
    (1, 2, 3, 5, 7, 9, 11, 13, 15)
  • A004275 1 together with nonnegative even numbers.
    (0, 1, 2, 4, 6, 8, 10, 12, 14)
  • A004276 0, 2, 4 and the odd numbers.
    (3, 4, 5, 7, 9, 11, 13, 15, 17)
  • ... 587 total
multiples of: e(n+2) - e(n+1) - e(n), where e(n) = a(n) / (n-1)! = 1, -1, -2, -2, -2, -2, -2, -2
  • A039593 Number of unitary divisors of central binomial coefficients.
    (32, 32, 64, 64, 64, 64, 64, 64)
  • A045948 a(n) = A003418(n)/A034386(n).
    (12, 12, 24, 24, 24, 24, 24, 24)
  • A046875 Row/column periods of Sprague-Grundy values of Wythoff's Game.
    (384, 384, 768, 768, 768, 768, 768, 768)
  • A046971 Maximal value of number of unitary divisors (see A034444) for integers in binary order range of n.
    (2048, 2048, 4096, 4096, 4096, 4096, 4096, 4096)
  • A048656 a(n) is the number of unitary (and also of squarefree) divisors of n!.
    (256, 256, 512, 512, 512, 512, 512, 512)
  • ... 147 total
e(n) + n, where e(n) = a(n) / (n-1)! = 1, 3, 5, 6, 7, 8, 9, 10, 11, 12
  • A039175 Numbers whose base-11 representation has the same number of 2's and 4's.
    (1, 3, 5, 6, 7, 8, 9, 10, 11, 12)
  • A039231 Numbers whose base-12 representation has the same number of 2's and 4's.
    (1, 3, 5, 6, 7, 8, 9, 10, 11, 12)
  • A138884 Numbers that are not even superperfect numbers.
    (1, 3, 5, 6, 7, 8, 9, 10, 11, 12)
  • A362018 Numbers k such that the digits of k^2 do not form a subsequence of the digits of 2^k.
    (1, 3, 5, 6, 7, 8, 9, 10, 11, 12)
multiples of: e(n) + n, where e(n) = a(n) / (n-1)! = 1, 3, 5, 6, 7, 8, 9, 10, 11, 12
  • A214586 Numbers k such that gcd(k!!+1,k-1) = 1.
    (2, 6, 10, 12, 14, 16, 18, 20, 22, 24)
deltas matching: e(n) + 3, where e(n) = a(n) / (n-1)! = 3, 4, 5, 5, 5, 5, 5, 5, 5, 5
  • A130224 a(1) = 1; a(n) = a(n-1) + (number of times the digit 1 has appeared in the sequence so far).
    (12, 15, 19, 24, 29, 34, 39, 44, 49, 54, 59)
  • A130231 a(1) = 3; a(n) = a(n-1) + (number of times the digit 3 has appeared in the sequence so far).
    (29, 32, 36, 41, 46, 51, 56, 61, 66, 71, 76)
  • A168101 a(n) = sum of natural numbers m such that n - 2 <= m <= n + 2.
    (3, 6, 10, 15, 20, 25, 30, 35, 40, 45, 50)
  • A312144 Coordination sequence Gal.6.151.1 where Gal.u.t.v denotes the coordination sequence for a vertex of type v in tiling number t in the Galebach list of u-uniform tilings.
    (1, 4, 8, 13, 18, 23, 28, 33, 38, 43, 48)
  • A357778 Maximum number of edges in a 5-degenerate graph with n vertices.
    (3, 6, 10, 15, 20, 25, 30, 35, 40, 45, 50)
multiples of: e(n) + 3, where e(n) = a(n) / (n-1)! = 3, 4, 5, 5, 5, 5, 5, 5, 5, 5
  • A292563 Expansion of Product_{k>=1} (1 + x^((2*k-1)^3)) / (1 - x^((2*k-1)^3)).
    (6, 8, 10, 10, 10, 10, 10, 10, 10, 10)
e(n) - n, where e(n) = a(n) / (n-1)! = -1, -1, -1, -2, -3, -4, -5, -6, -7, -8
  • A005709 a(n) = a(n-1) + a(n-7), with a(i) = 1 for i = 0..6.
    (1, 1, 1, 2, 3, 4, 5, 6, 7, 8)
  • A005710 a(n) = a(n-1) + a(n-8), with a(i) = 1 for i = 0..7.
    (1, 1, 1, 2, 3, 4, 5, 6, 7, 8)
  • A005711 a(n) = a(n-1) + a(n-9) for n >= 9; a(n) = 1 for n=0..7; a(8) = 2.
    (1, 1, 1, 2, 3, 4, 5, 6, 7, 8)
  • A023358 Number of compositions into sums of cubes.
    (1, 1, 1, 2, 3, 4, 5, 6, 7, 8)
  • A049810 a(n)=number of Farey fractions of order n that are <=1/6; cf. A049805.
    (1, 1, 1, 2, 3, 4, 5, 6, 7, 8)
  • ... 68 total
deltas matching: e(n) - n, where e(n) = a(n) / (n-1)! = 1, 1, 1, 2, 3, 4, 5, 6, 7, 8
  • A016028 Expansion of (1 - x + x^4) / (1 - x)^3.
    (1, 2, 3, 4, 6, 9, 13, 18, 24, 31, 39)
  • A098131 Number of compositions of n where the smallest part is greater than or equal to the number of parts.
    (3, 4, 5, 6, 8, 11, 15, 20, 26, 33, 41)
  • A098132 Number of compositions of n where the smallest part is greater than the number of parts.
    (4, 5, 6, 7, 9, 12, 16, 21, 27, 34, 42)
  • A177205 Partial sums of round(n^2/17).
    (0, 1, 2, 3, 5, 8, 12, 17, 23, 30, 38)
  • A332166 Inverse permutation to A332144.
    (8, 9, 10, 11, 13, 16, 20, 25, 31, 38, 46)
e(n) - 3, where e(n) = a(n) / (n-1)! = -3, -2, -1, -1, -1, -1, -1, -1, -1, -1
  • A016154 Inverse of 2145th cyclotomic polynomial.
    (3, 2, 1, -1, -1, -1, 1, 1, 1, -1)
  • A177121 Square array T(n,k) read by antidiagonals up: T(n,k) = 1 if n=1; otherwise if n divides k then T(n,k) = -n+1; otherwise T(n,k) = 1.
    (-3, -2, -1, 1, 1, 1, 1, 1, 1, 1)
deltas matching: e(n) - 3, where e(n) = a(n) / (n-1)! = 3, 2, 1, 1, 1, 1, 1, 1, 1, 1
  • A005788 Conductors of elliptic curves.
    (27, 30, 32, 33, 34, 35, 36, 37, 38, 39, 40)
  • A025020 Numbers whose least quadratic nonresidue (A020649) is 2.
    (45, 48, 50, 51, 52, 53, 54, 55, 56, 57, 58)
  • A025060 Numbers of the form i*j + j*k + k*i, where 1 <= i < j < k.
    (56, 59, 61, 62, 63, 64, 65, 66, 67, 68, 69)
  • A028790 Nonsquares mod 77.
    (21, 24, 26, 27, 28, 29, 30, 31, 32, 33, 34)
  • A030778 The second list after the following procedure: starting with a list [3] and an empty list, repeatedly add the distinct values in both lists in descending order to the second list and add the corresponding frequencies of those values to the first list.
    (18, 15, 13, 12, 11, 10, 9, 8, 7, 6, 5)
  • ... 55 total
multiples of: e(n) - 3, where e(n) = a(n) / (n-1)! = -3, -2, -1, -1, -1, -1, -1, -1, -1, -1
  • A092205 Number of units in the imaginary quadratic field Q(sqrt(-n)).
    (6, 4, 2, 2, 2, 2, 2, 2, 2, 2)
  • A143594 Triangle read by rows, A051731 * (an infinite lower triangular matrix with 1's in the first column and the rest 2's).
    (6, 4, 2, 2, 2, 2, 2, 2, 2, 2)
  • A220396 A modified Engel expansion of the Euler-Mascheroni constant gamma.
    (6, 4, 2, 2, 2, 2, 2, 2, 2, 2)
  • A299922 The sequence c(n) defined in A298737.
    (6, 4, 2, 2, 2, 2, 2, 2, 2, 2)
e(n+2) + 2*e(n+1) + e(n), where e(n) = a(n) / (n-1)! = 4, 7, 8, 8, 8, 8, 8, 8
  • A115291 Expansion of (1+x)^3/(1-x).
    (4, 7, 8, 8, 8, 8, 8, 8)
  • A341458 Unique square array T(n, k) read by antidiagonals, n, k > 0, such that A000069(T(n, k)) = A341288(A000069(n), A000069(k)).
    (4, 7, 8, 8, 8, 8, 8, 8)
  • A361928 Triangle read by rows: T(n,d) = number of non-adaptive group tests required to identify exactly d defectives among n items.
    (4, 7, 8, 8, 8, 8, 8, 8)
deltas matching: e(n+2) + 2*e(n+1) + e(n), where e(n) = a(n) / (n-1)! = 4, 7, 8, 8, 8, 8, 8, 8
  • A086570 Expansion of (1 + 3x + 5x^2 + 7x^3 + ...) / (1 - 2x + 3x^2 - 4x^3 + ...).
    (1, 5, 12, 20, 28, 36, 44, 52, 60)
e(n+3) + 3*e(n+2) + 3*e(n+1) + e(n), where e(n) = a(n) / (n-1)! = 11, 15, 16, 16, 16, 16, 16
  • A171418 Expansion of (1+x)^4/(1-x).
    (11, 15, 16, 16, 16, 16, 16)
coefficients of En(z) / (1+z)^2 = 0, 1, 0, 6, 0, 120, 0, 5040, 0, 362880
En(z) denotes the exponential generating function with coefficients a(n).
  • A005212 n! if n is odd otherwise 0 (from the Taylor series for sin x).
    (0, 1, 0, 6, 0, 120, 0, 5040, 0, 362880)
coefficients of En(z) / (1+z)^3 = 0, 1, -2, 12, -48, 360, -2160, 20160, -161280, 1814400
En(z) denotes the exponential generating function with coefficients a(n).
  • A052591 Expansion of e.g.f. x/((1-x)(1-x^2)).
    (0, 1, 2, 12, 48, 360, 2160, 20160, 161280, 1814400)
binomial transform: b(n) = sum C(n,k) a(k), for k=0..n = 0, 1, 6, 27, 124, 645, 3906, 27391, 219192, 1972809
  • A030297 a(n) = n*(n + a(n-1)) with a(0)=0.
    (0, 1, 6, 27, 124, 645, 3906, 27391, 219192, 1972809)
inverse binomial transform: b(n) = sum (-1)^(n-k) C(n,k) a(k), for k=0..n = 0, 1, 2, 3, 20, 85, 534, 3703, 29672, 266985
  • A348311 a(n) = n! * Sum_{k=1..n} (-1)^k * (k-2) / (k-1)!.
    (0, 1, 2, 3, 20, 85, 534, 3703, 29672, 266985)
multiples of: cumulative sum of a(n), ignoring leading 0s and 1s = 4, 16, 64, 304, 1744, 11824, 92464, 818224
  • A054116 T(n,n-1), array T as in A054115.
    (2, 8, 32, 152, 872, 5912, 46232, 409112)
  • A345889 Number of tilings of an n-cell circular array with rectangular tiles of any size, and where the number of possible colors of a tile is given by the smallest cell covered.
    (1, 4, 16, 76, 436, 2956, 23116, 204556)
cumulative product of a(n), ignoring leading 0s and 1s = 4, 48, 2304, 552960, 796262400, 8026324992000, 647242847354880000, 469742968896277708800000
  • A112693 Row sums of array A112692.
    (-4, -48, 2304, 552960, -796262400, -8026324992000, 647242847354880000, 469742968896277708800000)
multiples of: a(n), dropping 3 terms = 12, 48, 240, 1440, 10080, 80640, 725760
  • A001715 a(n) = n!/6.
    (1, 4, 20, 120, 840, 6720, 60480)
  • A002301 a(n) = n! / 3.
    (2, 8, 40, 240, 1680, 13440, 120960)
  • A052619 E.g.f. 3x^3/(1-x).
    (18, 72, 360, 2160, 15120, 120960, 1088640)
  • A052637 E.g.f. 3x(1+x-x^2)/(1-x).
    (18, 72, 360, 2160, 15120, 120960, 1088640)
  • A082569 a(1)=2; a(n)=ceiling(n*(a(n-1)-1/a(n-1))).
    (8, 32, 160, 960, 6720, 53760, 483840)
  • ... 9 total
a(n), dropping 4 terms = 48, 240, 1440, 10080, 80640, 725760
  • A052628 Expansion of e.g.f. (2+x^3-x^4)/(1-x).
    (48, 240, 1440, 10080, 80640, 725760)
  • A052642 Expansion of e.g.f. x^2*(2+x-x^2)/(1-x).
    (48, 240, 1440, 10080, 80640, 725760)
  • A052645 E.g.f. 2*x^2*(1+x-x^2)/(1-x).
    (48, 240, 1440, 10080, 80640, 725760)
  • A052683 Expansion of e.g.f. 2*x^4/(1-x).
    (48, 240, 1440, 10080, 80640, 725760)
multiples of: a(n), dropping 4 terms = 48, 240, 1440, 10080, 80640, 725760
  • A001720 a(n) = n!/24.
    (1, 5, 30, 210, 1680, 15120)
  • A050213 Triangle of number of permutations of {1, 2, ..., n} having exactly k cycles, each of which is of length >=r for r=5.
    (24, 120, 720, 5040, 40320, 362880)
  • A052565 E.g.f. (1+x^3-x^4)/(1-x).
    (24, 120, 720, 5040, 40320, 362880)
  • A052624 E.g.f. (1+x^2-2x^3+x^4)/(1-x)^2.
    (24, 120, 720, 5040, 40320, 362880)
  • A052686 Expansion of e.g.f. x^2*(1+3*x-3*x^2)/(1-x).
    (24, 120, 720, 5040, 40320, 362880)
  • ... 16 total
deltas matching: a(n) / gcd, from the 3rd term = 1, 3, 12, 60, 360, 2520, 20160, 181440
  • A014288 a(n) = floor(Sum_{k=0..n} k!/2), or floor( A003422(n+1)/2 ).
    (1, 2, 5, 17, 77, 437, 2957, 23117, 204557)
  • A093468 a(1) = 1, a(2) = 2; for n >= 2, a(n+1) = a(n) + Sum {a(n)-a(i), i = 1 to n}.
    (2, 3, 6, 18, 78, 438, 2958, 23118, 204558)

Search completed in 0.715 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 August 7 17:47 EDT 2024. Contains 375017 sequences. (Running on oeis4.)