Summary of block A080
Sequences in block A080
Section titled “Sequences in block A080”-
A080023: log_phi(n) is closer to an integer than is log_phi(m) for any m with 2<=m<n, where phi=(1+sqrt(5))/2 is the golden ratio.
-
A080029: a(n) is taken to be the smallest positive integer not already present which is consistent with the condition “n is a member of the sequence if and only if a(n) is a multiple of 3”.
-
A080031: a(n) is taken to be the smallest positive integer not already present which is consistent with the condition “n is a member of the sequence if and only if a(n) is congruent to 2 mod 3”.
-
A080036: a(n) = n + round(sqrt(2*n)) + 1.
-
A080037: a(0)=2; for n > 0, a(n) = n + floor(sqrt(4n-3)) + 2.
-
A080039: a(n) = floor((1+sqrt(2))^n).
-
A080040: a(n) = 2*a(n-1) + 2*a(n-2) for n > 1; a(0)=2, a(1)=2.
-
A080041: a(n) = floor((1+sqrt(3))^n).
-
A080042: a(n) = 4*a(n-1)+3*a(n-2) for n>1, a(0)=2, a(1)=4.
-
A080047: Operation count to create all permutations of n distinct elements using Algorithm L (lexicographic permutation generation) from Knuth’s The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of times l has to be repeatedly decreased in step L3.
-
A080048: Operation count to create all permutations of n distinct elements using Algorithm L (lexicographic permutation generation) from Knuth’s The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of loop repetitions in reversal step.
-
A080049: Operation count to create all permutations of n distinct elements using Algorithm L (lexicographic permutation generation) from Knuth’s The Art of Computer Programming, Vol. 4, chapter 7.2.1.2. Sequence gives number of interchange operations in step L4.
-
A080079: Least number causing the longest carry sequence when adding numbers <= n to n in binary representation.
-
A080097: a(n) = Fibonacci(n+2)^2 - 1.
-
A080141: a(n) = (3^(n-1))*(n!)^2.
-
A080145: a(n) = Sum_{m=1..n} Sum_{i=1..m} F(i)*F(i+1) where F(n)=Fibonacci numbers A000045.
-
A080151: Let m = Wonderful Demlo number A002477(n); a(n) = sum of digits of m.
-
A080176: Generalized Fermat numbers: 10^(2^n) + 1, n >= 0.
-
A080227: a(n) = n*a(n-1) + (1/2)*(1+(-1)^n), a(0)=0.
-
A080239: Antidiagonal sums of triangle A035317.
-
A080260: a(n)=1+(1/12)(n*(n+1)*(n+3)*(4-n)).
-
A080335: Diagonal in square spiral or maze arrangement of natural numbers.
-
A080339: Characteristic function of {1} union {primes}: 1 if n is 1 or a prime, else 0.
-
A080341: Sum of the first n terms that are congruent to 1, 4 or 5 mod 6 (A047259).
-
A080342: Number of weighings required to identify a single bad coin out of n coins, using a two-pan balance.
-
A080353: a(1)=5; for n>1, a(n)=a(n-1)+1 if n is already in the sequence, a(n)=a(n-1)+2 otherwise.
-
A080412: Exchange rightmost two binary digits of n > 1; a(0)=0, a(1)=2.
-
A080420: a(n) = (n+1)*(n+6)*3^n/6.
-
A080424: a(n) = 3*a(n-1) + 18*a(n-2), a(0)=0, a(1)=1.
-
A080425: Period 3: repeat [0, 2, 1].
-
A080455: a(1)=1; for n>1, a(n) = a(n-1) if n is already in the sequence, a(n) = a(n-1) + 4 otherwise.
-
A080456: a(1) = a(2) = 2; for n > 2, a(n) = a(n-1) if n is already in the sequence, a(n) = a(n-1) + 4 otherwise.
-
A080457: a(1)=3; for n>1, a(n)=a(n-1) if n is already in the sequence, a(n)=a(n-1)+4 otherwise.
-
A080458: a(1)=4; for n>1, a(n)=a(n-1) if n is already in the sequence, a(n)=a(n-1)+4 otherwise.
-
A080460: a(1) = 2; for n > 1, a(n) = a(n-1) if n is already in the sequence, a(n) = a(n-1) + 4 otherwise.
-
A080476: Floor( geometric mean of next n numbers ).
-
A080485: a(1) = 1, a(2) = a(1), a(3) = a(1) + a(2)^2, etc. a(n) = a(n-1) + a(n-1)^(n-1).
-
A080512: a(n) = n if n is odd, a(n) = 3*n/2 if n is even.
-
A080513: a(n) = round(n/2) + 1 = ceiling(n/2) + 1 = floor((n+1)/2) + 1.
-
A080522: Leading diagonal of triangle in A080521.
-
A080523: a(n) = n^n - n(n-1)/2.
-
A080545: Characteristic function of {1} union {odd primes}: 1 if n is 1 or an odd prime, else 0.
-
A080559: Duplicate of A010928.
-
A080565: Binary expansion of n has form 11**…*1.
-
A080568: Sum of the Fibonacci numbers A000045 and the factorials A000142.
-
A080590: a(1)=1; for n>1, a(n)=a(n-1)+3 if n is already in the sequence, a(n)=a(n-1)+4 otherwise.
-
A080599: Expansion of e.g.f.: 2/(2-2*x-x^2).
-
A080612: Numbers m such that (1/p(2*m+1)) * Sum_{k=1..m} p(2*k+1)-p(2*k) >= (1/p(2*m))* Sum_{k=1..m} p(2*k)-p(2*k-1) where p(k) denotes the k-th prime.
-
A080643: a(0)=0; for n>0, a(n) = 4^n - 2*3^(n-1).
-
A080652: a(1)=2; for n>1, a(n)=a(n-1)+3 if n is already in the sequence, a(n)=a(n-1)+2 otherwise.
-
A080663: a(n) = 3*n^2 - 1.
-
A080667: a(1)=3; for n>1, a(n)=a(n-1)+4 if n is already in the sequence, a(n)=a(n-1)+3 otherwise.
-
A080668: Numbers of the form n!+n^3.
-
A080674: a(n) = (4/3)*(4^n - 1).
-
A080675: a(n) = (5*4^n - 8)/6.
-
A080754: a(n) = ceiling(n*(1+sqrt(2))).
-
A080755: a(n) = ceiling(n*(1+1/sqrt(2))).
-
A080775: Number of n X n monomial matrices whose nonzero entries are unit Hurwitz quaternions.
-
A080782: a(1)=1, a(n)=a(n-1)-1 if n is already in the sequence, a(n)=a(n-1)+2 otherwise.
-
A080787: a(1)=a(2)=1; a(n) = a(n-1) + last decimal digit of a(n-2).
-
A080800: Similar to A080799 but count only division steps.
-
A080804: Least number of connected subgraphs of the binary cube GF(2)^n such that every vertex of GF(2)^n lies in at least one of the subgraphs and no two vertices lie in the same set of subgraphs (such a collection is called an identifying set).
-
A080827: Rounded up staircase on natural numbers.
-
A080838: Orchard crossing number of complete bipartite graph K_{1,n}.
-
A080855: a(n) = (9*n^2 - 3*n + 2)/2.
-
A080856: a(n) = 8*n^2 - 4*n + 1.
-
A080857: a(n) = (25*n^2 - 15*n + 2)/2.
-
A080859: a(n) = 6*n^2 + 4*n + 1.
-
A080860: a(n) = 10*n^2 + 5*n + 1.
-
A080861: a(n) = 15*n^2 + 6*n + 1.
-
A080880: a(n)*a(n+3) - a(n+1)*a(n+2) = 2^n, given a(0)=1, a(1)=2, a(2)=2.
-
A080891: Period 5: repeat [0, 1, -1, -1, 1].
-
A080921: a(n) = 2*a(n-1) + 48*a(n-2), a(0)=0, a(1)=1.
-
A080925: Binomial transform of Jacobsthal gap sequence (A080924).
-
A080926: Partial sums of A080925.
-
A080929: Sequence associated with a(n) = 2*a(n-1) + k*(k+2)*a(n-2).
-
A080930: a(n) = 2^(n-3)*(n+2)*(n+3)*(n+4)/3.
-
A080951: Sequence associated with recurrence a(n) = 2*a(n-1) + k*(k+2)*a(n-2).
-
A080954: E.g.f. exp(5x)/(1-x).
-
A080956: a(n) = (n+1)*(2-n)/2.
-
A080957: Expansion of (5 - 9*x + 6*x^2)/(1-x)^4.
-
A080960: Third binomial transform of A010685 (period 2: repeat 1,4).
-
A080961: Fourth binomial transform of A010686 (period 2: repeat 1,5).
-
A080995: Characteristic function of generalized pentagonal numbers A001318.