26016

Appears in sequences

• a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 1.at n=33A050043
• a(n) = 1 + (number of partitions of n, n>0).at n=38A052810
• Numbers k such that z(k) = j(k), where z(k) = sopf(k - d(k)), j(k) = d(sopf(k) + k), sopf(k) = A008472(k) and d(k) = A000005(k).at n=30A063961
• Number of unlock patterns of length n for the Android operating system.at n=6A163889
• Number of permutations of {1..n} with the sum of squared adjacent differences <= n*(n+1)/2.at n=10A180070
• Number of 3-step one or two space at a time rook's tours on an n X n board summed over all starting positions.at n=22A187288
• Number of minimal palindromic words of length n over {1,2} that begin with 1.at n=30A225368
• a(n) is the least k such that f(a(n-1)+1) + ... + f(k) > f(a(n-2)+1) + ... + f(a(n-1)) for n > 1, where f(n) = 1/(n+4) and a(1) = 1.at n=8A225919
• Number of length n+3 0..2 arrays with at most one downstep in every n consecutive neighbor pairs.at n=13A255110
• Number of (n+2) X (1+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00010101 01010101 or 01010111.at n=10A260131
• a(1) = 1; a(n) = Sum_{k=1..n} a(ceiling((n-1)/k)).at n=43A290845
• Expansion of Product_{k>=1} 1/((1 - x^(2*k))*(1 - x^(2*k-1))^3).at n=18A298311
• Numbers k such that A022567(k) is divisible by k.at n=16A304048
• a(n) = 102*2^n - 96 (n>=1).at n=7A304377
• G.f.: Sum_{n>=0} (n+1)*(n+2)/2 * (x + x^n)^n.at n=41A325998
• Number of polygons formed when every pair of vertices of a regular n-gon are joined by an infinite line.at n=23A344857
• A344857(2*n).at n=11A347320
• Numbers m such that the smallest digit in the decimal expansion of 1/m is 3, ignoring leading and trailing 0's.at n=23A352157