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,4,3,1,7,17,11

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.
  • A160266 Let f and its k-fold iteration f^k be defined as in A159885. a(n) is the least k for which A006694( (f^k(2n+1)-1)/2 ) < A006694(n).
    (1, 1, 1, 1, 6, 3, 1, 7, 17, 1)
Transformations to other sequences
These sequences match transformations of the original query.

a(n) for odd n = 1, 1, 4, 1, 17
  • A301624 G.f. A(x) satisfies: A(x) = Product_{k>=1} (1 - x^k*A(x)^k)^k.
    (-1, -1, 4, 1, -17)
  • A369912 a(n) = Sum_{p|n, p prime} p^sopf(n/p).
    (1, 1, 4, 1, 17)
deltas matching: a(n) for odd n = 1, 1, 4, 1, 17
  • A037309 Numbers whose base-3 and base-4 expansions have the same digit sum.
    (204, 205, 206, 210, 211, 228)
  • A060112 Sums of nonconsecutive factorial numbers.
    (0, 1, 2, 6, 7, 24)
  • A129645 a(1) = 1; for n>1, a(n) = a(n-1)*b(n-1) + 1, where {b(k)} is the concatenated list of the ordered positive divisors of the terms of {a(k)}.
    (1, 2, 3, 7, 8, 25)
  • A141485 Number of n X n binary matrices, symmetric about both diagonal and antidiagonal, with no more than 1 one in any 2 X 2 subblock.
    (1, 2, 1, 5, 4, 21)
  • A161979 a(1)=1. a(n) = the smallest integer > a(n-1) containing {the string made by reversing the order of the binary digits of n, and removing leading 0's} as a substring when a(n) is written in binary.
    (52, 53, 54, 58, 59, 76)
  • ... 6 total
a(n) for even n = 1, 1, 3, 7, 11
  • A052341 Shifts left two places under BIN1 transform.
    (1, 1, -3, 7, -11)
  • A057992 Number of commutative quasigroups of order n.
    (1, 1, 3, 7, 11)
  • A058282 Continued fraction for e^3.
    (1, 1, 3, 7, 11)
  • A062563 a(n) = Sum_{k=1..n} d(k)* mu(k), where d(k) is the number of divisors function.
    (-1, -1, 3, 7, 11)
  • A087517 j values from A087516.
    (1, 1, 3, 7, 11)
  • ... 20 total
deltas matching: a(n) for even n = 1, 1, 3, 7, 11
  • A014251 a(n) = b(n) - c(n) where b(n) is the n-th Fibonacci number greater than 2 and c(n) is the n-th number not in sequence b( ).
    (2, 3, 4, 7, 14, 25)
  • A070966 a(n) = Sum_{k|n, k<=sqrt(n)} phi(k); where the sum is over the positive divisors, k, of n, which are <= the square root of n; and phi(k) is the Euler totient function.
    (4, 3, 2, 5, 12, 1)
  • A072504 a(n) = LCM of divisors of n which are <= sqrt(n).
    (4, 3, 2, 5, 12, 1)
  • A086369 Number of factors over Q in the factorization of T_n(x) - 1 where T_n(x) is the Chebyshev polynomial of the first kind.
    (5, 6, 7, 10, 3, 14)
  • A090500 Sums described in A090499.
    (208, 209, 210, 213, 220, 231)
  • ... 23 total
multiples of: a(n) for even n = 1, 1, 3, 7, 11
  • A007683 a(1) = 1; a(n) = -Sum_{k = 1..n-1} (n+k)!a(k)/(2k)!.
    (-3, 3, 9, 21, -33)
  • A266007 Number of n X 3 integer arrays with each element equal to the number of horizontal and antidiagonal neighbors equal to itself.
    (2, 2, 6, 14, 22)
  • A275016 a(n) = (2^n - (-1+i)^n - (-1-i)^n)/4 - 1 where i is the imaginary unit.
    (5, 5, 15, 35, 55)
abs(a(n)), sorted with duplicates removed = 1, 3, 4, 7, 11, 17
  • A060962 Expansion of (1+x^2)*(1+x^5)/( Product_{j=1..7} (1-x^j) ).
    (1, 3, 4, 7, 11, 17)
  • A069950 Expansion of (1+x^2)*(1+x^5)*(1+x^8)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)*(1-x^5)*(1-x^6)*(1-x^7)*(1-x^8)*(1-x^9)*(1-x^10)).
    (1, 3, 4, 7, 11, 17)
  • A147869 Expansion of Product_{k>0} (1 + A004001(k)*x^k).
    (1, 3, 4, 7, 11, 17)
  • A319106 Expansion of Product_{k>=1} (1 + x^k)^ceiling(k/2).
    (1, 3, 4, 7, 11, 17)
deltas matching: abs(a(n)), sorted with duplicates removed = 1, 3, 4, 7, 11, 17
  • A018145 Powers of fifth root of 11 rounded to nearest integer.
    (3, 4, 7, 11, 18, 29, 46)
  • A050195 a(n)=a(n-1)+a(n-2)-d, where d=a(n/5) if 5 divides n, else d=0; 2 initial terms.
    (3, 4, 7, 11, 18, 29, 46)
  • A093333 a(0) = 0, a(1) = 1 and for n >= 0, a(n+2) = floor(2 * sqrt(a(n) * a(n+1))).
    (4, 5, 8, 12, 19, 30, 47)
  • A222329 Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..3 array extended with zeros and convolved with 1,1.
    (3, 4, 7, 11, 18, 29, 46)
  • A222334 T(n,k)=Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..k array extended with zeros and convolved with 1,1
    (3, 4, 7, 11, 18, 29, 46)
  • ... 7 total

Search completed in 1.034 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.)