18390

Appears in sequences

• Number of partitions of n into parts not of the form 25k, 25k+5 or 25k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=38A036004
• a(n) = 60*n^2 + 180*n + 150.at n=15A069477
• Third differences of fifth powers (A000584).at n=18A101096
• G.f. satisfies: 7*A(x) = 6 + x + A(x)^6, starting with [1,1,15].at n=4A120600
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, -1), (0, 1, 1), (1, -1, 0), (1, 0, 0)}.at n=8A150022
• Array: row n shows the coefficients of the characteristic polynomial of the n-th principal submatrix of the symmetric matrix A115216; by antidiagonals.at n=39A202868
• Number of length n+6 0..3 arrays with no seven consecutive terms having the maximum of any three terms equal to the minimum of the remaining four terms.at n=1A249878
• T(n,k)=Number of length n+6 0..k arrays with no seven consecutive terms having the maximum of any three terms equal to the minimum of the remaining four terms.at n=7A249883
• Number of length 2+6 0..n arrays with no seven consecutive terms having the maximum of any three terms equal to the minimum of the remaining four terms.at n=2A249885
• Number of (n+1)X(3+1) 0..1 arrays with each row and column not divisible by 3, read as a binary number with top and left being the most significant bits.at n=3A263055
• Number of (n+1)X(4+1) 0..1 arrays with each row and column not divisible by 3, read as a binary number with top and left being the most significant bits.at n=2A263056
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each row and column not divisible by 3, read as a binary number with top and left being the most significant bits.at n=17A263060
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each row and column not divisible by 3, read as a binary number with top and left being the most significant bits.at n=18A263060
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 657", based on the 5-celled von Neumann neighborhood.at n=23A273336
• Indices of records in A100695.at n=20A287636
• a(n) = A293518(n) - A293519(n); how many more surviving even nodes than surviving (but not bifurcating) odd nodes there are at generation n in the binary tree of persistently squarefree numbers.at n=37A293517
• a(n) is the least integer k such that k/Fibonacci(n) > e.at n=20A293675
• Solution of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1) + 3, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=42A294871
• a(1) = 1; a(n+1) = Sum_{d|n} sigma(n/d)*a(d), where sigma = sum of divisors (A000203).at n=35A307817
• Partial sums of A185381.at n=13A350678