Summary of block A178
Sequences in block A178
Section titled “Sequences in block A178”-
A178027: Multiples of 5291.
-
A178073: Partial sums of sequence A177342.
-
A178142: Sum over the divisors d = 2 and/or 3 of n.
-
A178146: a(n) is the number of distinct prime factors <= 5 of n.
-
A178181: Minute with hour hand overlap problem on analog clock.
-
A178184: Sum 2^((k^2+3k)/2) from k=1 to n.
-
A178185: Numerator of Sum_{k=1..n} 1/2^((k^2 + 3*k)/2).
-
A178187: Numerators of sum (1/3)^((k^2+3k)/2) from k=1 to n.
-
A178189: Numerators of sum (1/5)^((k^2+3k)/2) from k=1 to n.
-
A178207: a(n) = 4*n - 2*A000120(n) + 1 where A000120(n) = number of nonzero digits in the binary representation of n.
-
A178208: Number of ways to choose three points in an (n X n)-grid (or geoplane).
-
A178218: Numbers of the form 2k^2-2k+1 or 2k^2-1.
-
A178222: Partial sums of floor(3^n/4).
-
A178248: a(n) = 12^n + 1.
-
A178312: a(n) = n * T(ceiling(n/2)), where T are the triangular numbers, A000217.
-
A178349: Partial sums of sum_{n=0…infinity} 1010^n.
-
A178390: a(n) = (n^2+1)^2+1.
-
A178392: a(n) = (n^2-1)^2-1.
-
A178393: a(n) = (n^3-1)^3-1.
-
A178397: Partial sums of round(7^n/10).
-
A178414: Least odd number in the Collatz (3x+1) preimage of odd numbers not a multiple of 3.
-
A178420: Partial sums of floor(2^n/3).
-
A178428: 5 followed by the generalized Fermat numbers 6^(2^n)+1 (A078303).
-
A178452: Partial sums of floor(2^n/5).
-
A178455: Partial sums of floor(2^n/7).
-
A178459: Partial sums of floor(2^n/31).
-
A178460: Partial sums of floor(2^n/127).
-
A178487: a(n) = floor(n^(1/5)): integer part of fifth root of n.
-
A178489: a(n) = floor(n^(1/6)): integer part of sixth root of n.
-
A178500: a(n) = 10^n * signum(n).
-
A178501: Zero followed by powers of ten.
-
A178512: Reversed decimal expansions of A178510.
-
A178513: Partial sums of 80^n.
-
A178521: The cost of all leaves in the Fibonacci tree of order n.
-
A178543: Partial sums of round(3^n/5).
-
A178572: Numbers with ordered partitions that have periods of length 5.
-
A178574: a(n) = 2*n*(9*n-1).
-
A178577: Partial sums of round(5^n/9).
-
A178596: Records in A039996.
-
A178617: a(n) = n^4 - (n+1)^3.
-
A178630: a(n) = 18*((10^n - 1)/9)^2.
-
A178635: a(n) = 72*((10^n - 1)/9)^2.
-
A178648: Primes p such that primorial(p)/2 +- 2 are primes.
-
A178671: a(n) = 5^n - 5.
-
A178672: a(n) = 6^n - 6.
-
A178674: a(n) = 3^n + 3.
-
A178675: a(n) = 4^n + 4.
-
A178676: a(n) = 5^n + 5.
-
A178681: a(n) = 6^n + 6.
-
A178703: Partial sums of round(3^n/7).
-
A178704: Partial sums of floor(3^n/7).
-
A178719: Partial sums of (1/5)*floor(6^n/7).
-
A178730: Partial sums of floor(7^n/8)/6.
-
A178742: Partial sums of floor(2^n/9).
-
A178744: Partial sums of floor(4^n/9).
-
A178750: Partial sums of floor(5^n/9).
-
A178759: Expansion of e.g.f. 3*x*exp(x)*(exp(x)-1)^2.
-
A178769: a(n) = (5*10^n + 13)/9.
-
A178784: Let d be the vector of divisors of 100 sorted from largest to smallest, i.e., [100,50,25,20,10,5,4,2,1]. Then a(n) = 100/d(n) - 1.
-
A178789: a(n) = 4^(n-1) + 2: Number of acute angles after n iterations of the Koch snowflake construction.
-
A178804: When dealing cards into 3 piles (Left, Center, Right), the number of cards in the n-th card’s pile, if dealing in a pattern L, C, R, C, L, C, R, C, L, C, … [as any thoughtful six-year-old will try to do when sharing a pile of candy among 3 people].
-
A178815: First base of a nonzero Fermat quotient mod the n-th prime.
-
A178827: Partial sums of floor(8^n/9)/7.
-
A178828: Partial sums of floor(3^n/10)/2.
-
A178832: Number of minima of the 1-D Griewank function in [-n, n].
-
A178853: “Josephus problem”: n persons stand in a circle and eliminate every seventh person counting clockwise until only person a(n) is remaining.
-
A178869: a(n) = 9*a(n-1) - 10*a(n-2); a(0)=0, a(1)=1.
-
A178872: Partial sums of round(4^n/7).
-
A178874: Partial sums of round(5^n/8).
-
A178875: Partial sums of round(4^n/9).
-
A178901: a(1)=2; for n > 1, a(n) is the largest number <= 2*a(n-1) divisible by n.
-
A178935: a(n) = floor((3*4^n - 2*3^n)/5).
-
A178936: a(n) = floor((2*3^n+3*2^n)/5).
-
A178939: Maximal AND-OR-XOR formula complexity (operator count) for n-input Boolean functions.
-
A178945: Expansion of x*(1-x)^2/( (1-2*x^2)*(1-2*x)^2).
-
A178947: Expansion of x*(1+2*x+8*x^2+4*x^3+3*x^4) / ( (1+x)^2*(x-1)^4 ).
-
A178970: a(n) = 2^(2n-1) mod (2n+1).
-
A178977: a(n) = (3*n+2)*(3*n+5)/2.
-
A178982: Partial sums of floor(Fibonacci(n)/2).
-
A178987: a(n) = n*(n-3)*2^(n-2).