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:1,1,1,1,1,2,1,3,6,1

Sorry, but the terms do not match anything in the table.

The following advanced matches exist for the numeric terms in your query.
    
Matches after removing first term
These sequences match the terms with the first removed.
  • A182928 Triangular array read by rows: [T(n,k),k=1..tau(n)] = [-n!/(d*(-(n/d)!)^d), d|n].
    (1, 1, -1, 1, 2, 1, -3, -6, 1)
Transformations to other sequences
These sequences match transformations of the original query.

deltas matching: a(n) itself = 1, 1, 1, 1, 1, 2, 1, 3, 6, 1
  • A016070 Numbers k such that k^2 contains exactly 2 different digits, excluding 10^m, 2*10^m, 3*10^m.
    (4, 5, 6, 7, 8, 9, 11, 12, 15, 21, 22)
  • A034709 Numbers divisible by their last digit.
    (4, 5, 6, 7, 8, 9, 11, 12, 15, 21, 22)
  • A178158 Numbers n that are divisible by every suffix of n.
    (4, 5, 6, 7, 8, 9, 11, 12, 15, 21, 22)
a(n), dropping leading 0s and 1s = 2, 1, 3, 6, 1
  • A010251 Continued fraction for cube root of 21.
    (2, 1, 3, 6, 1)
  • A016489 Continued fraction for log(61).
    (2, 1, 3, 6, 1)
  • A029810 Erroneous version of A033809, A046067.
    (2, 1, 3, 6, 1)
  • A033809 Smallest m>0 such that (2n-1)2^m+1 is prime, or -1 if no such value exists.
    (2, 1, 3, 6, 1)
  • A035206 Number of multisets associated with least integer of each prime signature.
    (2, 1, 3, 6, 1)
  • ... 85 total
deltas matching: a(n), dropping leading 0s and 1s = 2, 1, 3, 6, 1
  • A002504 Numbers x such that 1 + 3*x*(x-1) is a ("cuban") prime (cf. A002407).
    (12, 14, 15, 18, 24, 25)
  • A003621 Number of iterations until n reaches 1 or 4 under x goes to sum of squares of digits map.
    (10, 8, 9, 12, 6, 7)
  • A005423 A finite sequence associated with the Lie algebra A_6.
    (8, 10, 11, 14, 20, 21)
  • A007933 Some permutation of digits is a prime.
    (17, 19, 20, 23, 29, 30)
  • A010528 Decimal expansion of square root of 76.
    (1, 3, 4, 7, 1, 0)
  • ... 137 total
multiples of: a(n), dropping leading 0s and 1s = 2, 1, 3, 6, 1
  • A104000 Square array T(r,m) read by antidiagonals: number of cyclically reduced words of length m in F_r.
    (4, 2, 6, 12, 2)
  • A178802 Multiply, cell by cell, sequence A048996 by A178801.
    (1440, 720, 2160, 4320, 720)
  • A199943 T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zeroth through n-1st differences all nonzero
    (4, 2, 6, 12, 2)
  • A335340 North-East paths from (0,0) to (n,n) with k cyclic descents.
    (4, 2, 6, 12, 2)
  • A356266 Partition triangle read by rows, counting reducible permutations with weakly decreasing Lehmer code, refining triangle A356115.
    (4, 2, 6, 12, 2)
  • ... 6 total
a(n)+1, after dropping leading 0s and 1s = 3, 2, 4, 7, 2
  • A011056 Decimal expansion of 4th root of 63.
    (3, 2, 4, 7, 2)
  • A059444 Decimal expansion of square root of (Pi * e / 2).
    (3, 2, 4, 7, 2)
  • A073447 Decimal expansion of csc(1).
    (3, 2, 4, 7, 2)
  • A083514 Number of steps for iteration of map x -> (4/3)*ceiling(x) to reach an integer > 3n+1 when started at 3n+1, or -1 if no such integer is ever reached.
    (3, 2, 4, 7, 2)
  • A085609 Decimal expansion of Sum{p prime>=2} log(p)/(p^2-p+1).
    (3, 2, 4, 7, 2)
  • ... 26 total
deltas matching: a(n)+1, after dropping leading 0s and 1s = 3, 2, 4, 7, 2
  • A010481 Decimal expansion of square root of 26.
    (9, 6, 4, 0, 7, 5)
  • A011313 Decimal expansion of 14th root of 12.
    (5, 2, 4, 0, 7, 5)
  • A016612 Decimal expansion of log(71/2).
    (9, 6, 4, 8, 1, 3)
  • A020841 Decimal expansion of 1/sqrt(84).
    (7, 4, 6, 2, 9, 7)
  • A060214 Successive digits of the Lucas sequence.
    (3, 6, 4, 0, 7, 9)
  • ... 34 total
a(n)-1, after dropping leading 0s and 1s = 1, 0, 2, 5, 0
  • A021882 Decimal expansion of 1/878.
    (1, 0, 2, 5, 0)
  • A035151 Coefficients in expansion of Dirichlet series Product_p (1-(Kronecker(m,p)+1)*p^(-s)+Kronecker(m,p)*p^(-2s))^(-1) for m = -39.
    (1, 0, 2, 5, 0)
  • A070679 Smallest m in range 1..phi(n) such that 9^m == 1 mod n, or 0 if no such number exists.
    (1, 0, 2, 5, 0)
  • A071581 A003656(n)-prime(n).
    (1, 0, -2, 5, 0)
  • A072340 Number of steps to reach an integer starting with n/3 and iterating the map x -> x*ceiling(x), or -1 if no integer is ever reached.
    (1, 0, 2, 5, 0)
  • ... 43 total
deltas matching: a(n)-1, after dropping leading 0s and 1s = 1, 0, 2, 5, 0
  • A004565 Expansion of sqrt(6) in base 6.
    (1, 2, 2, 0, 5, 5)
  • A011180 Decimal expansion of 5th root of 95.
    (8, 7, 7, 9, 4, 4)
  • A011265 Decimal expansion of 11th root of 9.
    (6, 5, 5, 3, 8, 8)
  • A011440 Decimal expansion of 21st root of 21.
    (3, 4, 4, 6, 1, 1)
  • A021867 Decimal expansion of 1/863.
    (5, 4, 4, 6, 1, 1)
  • ... 79 total
a(n) for odd n = 1, 1, 1, 1, 6
  • A000383 Hexanacci numbers with a(0) = ... = a(5) = 1.
    (1, 1, 1, 1, 6)
  • A000976 Period of 1/n! in base 10.
    (1, 1, 1, 1, 6)
  • A005483 Continued fraction for cube root of 7.
    (1, 1, 1, 1, 6)
  • A007732 Period of decimal representation of 1/n.
    (1, 1, 1, 1, 6)
  • A009194 a(n) = gcd(n, sigma(n)).
    (1, 1, 1, 1, 6)
  • ... 712 total
deltas matching: a(n) for odd n = 1, 1, 1, 1, 6
  • A000924 Class number of Q(sqrt(-n)), n squarefree.
    (4, 5, 4, 3, 4, 10)
  • A001746 At least one digit contains a loop (version 1).
    (66, 67, 68, 69, 70, 76)
  • A002153 Numbers k for which the rank of the elliptic curve y^2 = x^3 + k is 1.
    (8, 9, 10, 11, 12, 18)
  • A002260 Triangle read by rows: T(n,k) = k for n >= 1, k = 1..n.
    (3, 4, 5, 6, 7, 1)
  • A002262 Triangle read by rows: T(n,k) = k, 0 <= k <= n, in which row n lists the first n+1 nonnegative integers.
    (2, 3, 4, 5, 6, 0)
  • ... 1394 total
multiples of: a(n) for odd n = 1, 1, 1, 1, 6
  • A008941 Degrees of irreducible representations of group U3(7).
    (43, 43, 43, 43, 258)
  • A024729 a(n) = Sum_{i=1..floor((n+1)/4)} a(2*i-1) * a(n-2*i+1), with a(1)=a(2)=1 and a(3)=5.
    (5, 5, 5, 5, 30)
  • A025479 Largest exponents of perfect powers (A001597).
    (2, 2, 2, 2, 12)
  • A030205 Expansion of q^(-1/2) * eta(q)^2 * eta(q^5)^2 in power of q.
    (2, 2, -2, 2, -12)
  • A050206 Triangle read by rows: smallest denominator of the expansion of k/n using the greedy algorithm, 1<=k<=n-1.
    (2, 2, 2, 2, 12)
  • ... 56 total
a(n) for even n = 1, 1, 2, 3, 1
  • A000188 (1) Number of solutions to x^2 == 0 (mod n). (2) Also square root of largest square dividing n. (3) Also max_{ d divides n } gcd(d, n/d).
    (1, 1, 2, 3, 1)
  • A000189 Number of solutions to x^3 == 0 (mod n).
    (1, 1, 2, 3, 1)
  • A000190 Number of solutions to x^4 == 0 (mod n).
    (1, 1, 2, 3, 1)
  • A000319 a(n) = floor(b(n)), where b(n) = tan(b(n-1)), b(0)=1.
    (-1, -1, -2, -3, 1)
  • A001165 Position of first even digit after decimal point in sqrt(n).
    (1, 1, 2, 3, 1)
  • ... 1411 total
deltas matching: a(n) for even n = 1, 1, 2, 3, 1
  • A000394 Numbers of form x^2 + y^2 + 7z^2.
    (16, 17, 18, 20, 23, 24)
  • A000408 Numbers that are the sum of three nonzero squares.
    (34, 35, 36, 38, 41, 42)
  • A001156 Number of partitions of n into squares.
    (19, 20, 21, 23, 26, 27)
  • A001826 Number of divisors of n of the form 4k+1.
    (2, 1, 2, 4, 1, 2)
  • A002152 Numbers k for which the rank of the elliptic curve y^2 = x^3 - k is 1.
    (21, 22, 23, 25, 28, 29)
  • ... 2189 total
multiples of: a(n) for even n = 1, 1, 2, 3, 1
  • A004024 Theta series of b.c.c. lattice with respect to deep hole.
    (4, 4, 8, 12, 4)
  • A005793 Number of O_1^{2+}(Z)-orbits of Lorentzian modular group.
    (2, 2, 4, 6, 2)
  • A010768 Decimal expansion of 6th root of 2.
    (2, 2, 4, 6, 2)
  • A011433 Decimal expansion of 14th root of 20.
    (2, 2, 4, 6, 2)
  • A019948 Decimal expansion of tangent of 50 degrees.
    (3, 3, 6, 9, 3)
  • ... 144 total
a(n+1) - a(n) = 0, 0, 0, 0, -1, 1, -2, -3, 5
  • A004199 Table of [ x/y ], where (x,y) = (1,1),(1,2),(2,1),(1,3),(2,2),(3,1),...
    (0, 0, 0, 0, 1, 1, 2, 3, 5)
  • A011864 a(n) = floor(n*(n - 1)/11).
    (0, 0, 0, 0, 1, 1, 2, 3, 5)
  • A024789 Number of 5's in all partitions of n.
    (0, 0, 0, 0, 1, 1, 2, 3, 5)
  • A024790 Number of 6's in all partitions of n.
    (0, 0, 0, 0, 1, 1, 2, 3, 5)
  • A024791 Number of 7's in all partitions of n.
    (0, 0, 0, 0, 1, 1, 2, 3, 5)
  • ... 83 total
deltas matching: a(n+1) - a(n) = 0, 0, 0, 0, 1, 1, 2, 3, 5
  • A030036 a(n+1) = Sum_{k=0..floor(n/5)} a(k) * a(n-k).
    (1, 1, 1, 1, 1, 2, 3, 5, 8, 13)
  • A132916 a(0)=0; a(1)=1; a(n) = Sum_{k=1..floor(n^(1/3))} a(n-k) for n >= 2.
    (1, 1, 1, 1, 1, 2, 3, 5, 8, 13)
  • A179111 Partial sums of round(Fibonacci(n)/11).
    (0, 0, 0, 0, 0, 1, 2, 4, 7, 12)
deltas matching: a(n+3) - 3*a(n+2) + 3*a(n+3) - a(n) = 0, 0, 1, 3, 5, 2, 9
  • A132699 Decimal expansion of 9/Pi.
    (5, 5, 5, 4, 7, 2, 0, 9)
deltas matching: coefficients of Sn(z) / (1+z) = 1, 0, 1, 0, 1, 1, 0, 3, 3, 2
Sn(z) denotes the ordinary generating function with coefficients a(n).
  • A283467 a(n) = A005185(n+1-A005185(n)).
    (19, 20, 20, 21, 21, 20, 19, 19, 22, 19, 21)
  • A304115 Restricted growth sequence transform of A046523(A098550(n)), a filter sequence based on the prime signature of the Yellowstone permutation.
    (1, 2, 2, 3, 3, 4, 5, 5, 2, 5, 3)
a(n+2) - a(n) = 0, 0, 0, 1, 0, 1, 5, -2
  • A167230 The matrix exponential of Sierpiński's triangle (A047999) scaled by exp(-1).
    (0, 0, 0, 1, 0, 1, 5, 2)
deltas matching: a(n+2) - a(n) = 0, 0, 0, 1, 0, 1, 5, 2
  • A077053 Greatest common divisor of indecomposable Wallis pairs.
    (1, 1, 1, 1, 2, 2, 1, 6, 4)
deltas matching: a(n) - 2 = 1, 1, 1, 1, 1, 0, 1, 1, 4, 1
  • A176208 An irregular table with shape sequence A058884 measuring the length of ordered partitions defined by A176207.
    (3, 4, 3, 4, 5, 4, 4, 5, 6, 2, 3)
  • A244040 Sum of digits of n in fractional base 3/2.
    (4, 5, 6, 5, 6, 7, 7, 8, 9, 5, 6)
  • A327191 For any n >= 0: consider the different ways to split the binary representation of n into two (possibly empty) parts, say with value x and y; a(n) is the least possible value of abs(x - y).
    (2, 3, 2, 1, 0, 1, 1, 0, 1, 5, 6)
  • A336033 a(n) is the number of k such that 1 <= k < n and a(k) XOR ... XOR a(n-1) = 0 (where XOR denotes the bitwise XOR operator).
    (1, 0, 1, 2, 3, 2, 2, 3, 4, 0, 1)
  • A343854 Irregular triangle read by rows: the n-th row gives the column indices of the matrix of 1..n^2 filled successively back and forth along antidiagonals.
    (4, 3, 2, 3, 4, 5, 5, 4, 5, 1, 2)
a(n+2) - a(n+1) + a(n) = 1, 1, 1, 2, 0, 4, 4, -2
  • A073084 Decimal expansion of -x, where x is the negative solution to the equation 2^x = x^2.
    (1, 1, 1, 2, 0, 4, 4, 2)
abs(a(n)), sorted with duplicates removed = 1, 2, 3, 6
  • A000055 Number of trees with n unlabeled nodes.
    (1, 2, 3, 6)
  • A000308 a(n) = a(n-1)*a(n-2)*a(n-3) with a(1)=1, a(2)=2 and a(3)=3.
    (1, 2, 3, 6)
  • A000341 Number of ways to pair up {1..2n} so sum of each pair is prime.
    (1, 2, 3, 6)
  • A000616 a(-1)=1 by convention; for n >= 0, a(n) = number of irreducible Boolean functions of n variables.
    (1, 2, 3, 6)
  • A000646 Number of alkyls Y^{II} C_n H_{2n+2} with n carbon atoms.
    (1, 2, 3, 6)
  • ... 2241 total
deltas matching: abs(a(n)), sorted with duplicates removed = 1, 2, 3, 6
  • A000046 Number of primitive n-bead necklaces (turning over is allowed) where complements are equivalent.
    (2, 3, 5, 8, 14)
  • A000073 Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) for n >= 3 with a(0) = a(1) = 0 and a(2) = 1.
    (1, 2, 4, 7, 13)
  • A000074 Number of odd integers <= 2^n of form x^2 + y^2.
    (1, 2, 4, 7, 13)
  • A000621 Number of monosubstituted alkanes C(n-1)H(2n-1)-X with n-1 carbon atoms that are not stereoisomers.
    (2, 3, 5, 8, 14)
  • A001036 Partial sums of A001037, omitting A001037(1).
    (1, 2, 4, 7, 13)
  • ... 1163 total
multiples of: abs(a(n)), sorted with duplicates removed = 1, 2, 3, 6
  • A001679 Number of series-reduced rooted trees with n nodes.
    (2, 4, 6, 12)
  • A002182 Highly composite numbers, definition (1): numbers n where d(n), the number of divisors of n (A000005), increases to a record.
    (2, 4, 6, 12)
  • A003000 Number of bifix-free (or primary, or unbordered) words of length n over a two-letter alphabet.
    (2, 4, 6, 12)
  • A004394 Superabundant [or super-abundant] numbers: n such that sigma(n)/n > sigma(m)/m for all m < n, sigma(n) being A000203(n), the sum of the divisors of n.
    (2, 4, 6, 12)
  • A004653 Powers of 2 written in base 14. (Next term contains a non-decimal character.)
    (4, 8, 12, 24)
  • ... 561 total
deltas matching: cumulative sum of a(n), ignoring leading 0s and 1s = 2, 3, 6, 12, 13
  • A186077 Index of Fibonacci and tribonacci numbers having the same last digit.
    (8, 10, 13, 19, 31, 44)
multiples of: cumulative sum of a(n), ignoring leading 0s and 1s = 2, 3, 6, 12, 13
  • A324059 Numbers n such that sigma(n)/(phi(n) + tau(n)) is a record.
    (18480, 27720, 55440, 110880, 120120)

Search completed in 0.052 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 15:23 EDT 2024. Contains 374234 sequences. (Running on oeis4.)