18768

Appears in sequences

• Total length of performances of n fragments in Stockhausen problem.at n=3A008274
• Numbers k such that phi(k) + 2 | sigma(k + 2).at n=21A015781
• a(n) = number of (s(0), s(1), ..., s(2*n-1)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| = 1 for i = 1,2,...,n, s(0) = 3, s(2*n-1) = 6. Also a(n) = T(2*n-1,n-2), where T is defined in A026022.at n=7A026027
• Distinct even elements in the 5-Pascal triangle A028313.at n=42A028320
• Even elements to the right of the central elements of the 5-Pascal triangle A028313.at n=36A028321
• Numerators of continued fraction convergents to sqrt(383).at n=7A041726
• Numbers with multiplicative persistence value 6.at n=20A046515
• T(n,k)=S(2n+1,n-1,k-1), 0<=k<=n, n >= 0, array S as in A050157.at n=40A050161
• T(n,k)=S(2n+3,n+3,k+3), 0<=k<=n, n >= 0, array S as in A050157.at n=31A050164
• a(n) = n*(n+1)*(n^2 + n + 4)/4.at n=16A061316
• Engel expansion of sinh(1/2).at n=34A068379
• Product of prime(n+1)-1 and prime(n)-1.at n=32A083553
• a(n) = (prime(n)-1)*(prime(n)+1).at n=32A084920
• Smallest multiple of n sandwiched between two numbers both having square divisors.at n=47A085051
• Triangular array read by rows: a(n, k) = sum of number of ordered factorizations of all prime signatures with n total prime factors and k distinct prime factors.at n=37A095705
• 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, 1), (0, 0, -1), (0, 1, 0), (0, 1, 1), (1, 0, 1)}.at n=7A151132
• Least k(n) such that 3*2^k(n)*M(n)-1 or 3*2^k(n)*M(n)+1 is prime (or both primes) with M(i)=i-th Mersenne prime.at n=27A152097
• a(n) = 2401*n^2 - 980*n + 99.at n=2A157375
• 3-comma numbers: n occurs in the sequence S[k+1]=S[k]+10*last_digit(S[k-1])+first_digit(S[k]) for three different splittings n=concat(S[0],S[1]).at n=19A166513
• Totally multiplicative sequence with a(p) = 7p+2 for prime p.at n=41A166675