28673

Appears in sequences

• Equivalent of the Kurepa hypothesis for left factorial.at n=7A052169
• a(0) = 8; for n>0, a(n) = 2*a(n-1) - 1.at n=12A083686
• Numerator of Sum_{k=1..n} (-1)^(k+1)/k!.at n=9A103816
• Numbers k such that (2*k)!/(2*(k!)^2) - 1 is prime.at n=29A112861
• a(n) = 1 + (n-6)*2^(n-1).at n=7A115342
• A132749 * [1, 2, 3, ...] = A007318 * A065190.at n=12A132750
• a(n) = smallest k > 1 such that k-1 and k+1 together have n prime divisors.at n=19A155850
• a(n) = 28*n^2 + 1.at n=32A158556
• G.f.: (1+62*x+561*x^2+1014*x^3+449*x^4+48*x^5+x^6)/(1-x)^7.at n=4A160788
• Triangle read by rows in which row n lists n+1 terms, starting with n, such that the difference between successive terms is equal to n^4 - 1.at n=43A162622
• Triangle read by rows in which row n lists n terms, starting with n, such that the difference between successive terms is equal to n^4 - 1 = A123865(n).at n=35A162623
• Triangle read by rows in which row n lists n terms, starting with n^4 + n - 1, such that the difference between successive terms is equal to n^4 - 1 = A123865(n).at n=34A162624
• a(n) = 7*4^n+1.at n=6A199207
• a(n) = 7*8^n+1.at n=4A199555
• Numbers n such that n^3 contains the consecutive substring 2,3,5,7.at n=26A295900
• a(n) = 7*2^n + (-1)^n.at n=12A321483
• a(n) is the number of overpartitions of n where overlined parts are not divisible by 3 and non-overlined parts are congruent to 1 modulo 3.at n=46A335754
• Number of odd-length multiset partitions of integer partitions of n.at n=17A358837
• a(n) = Sum_{d|n} d * 4^(d-1).at n=6A359186
• a(n) = Sum_{d|n} (n/d) * 4^(n-d).at n=6A359204