A188859 -id:A188859 - cp's OEIS frontend

A023416 Number of 0's in binary expansion of n.

1, 0, 1, 0, 2, 1, 1, 0, 3, 2, 2, 1, 2, 1, 1, 0, 4, 3, 3, 2, 3, 2, 2, 1, 3, 2, 2, 1, 2, 1, 1, 0, 5, 4, 4, 3, 4, 3, 3, 2, 4, 3, 3, 2, 3, 2, 2, 1, 4, 3, 3, 2, 3, 2, 2, 1, 3, 2, 2, 1, 2, 1, 1, 0, 6, 5, 5, 4, 5, 4, 4, 3, 5, 4, 4, 3, 4, 3, 3, 2, 5, 4, 4, 3, 4, 3, 3, 2, 4, 3, 3, 2, 3, 2, 2, 1, 5, 4, 4, 3, 4, 3, 3, 2, 4

Offset: 0

David W. Wilson

Another version (A080791) has a(0) = 0.

N. J. A. Sloane, Table of n, a(n) for n = 0..10000
Franklin T. Adams-Watters and Frank Ruskey, Generating Functions for the Digital Sum and Other Digit Counting Sequences, JIS 12 (2009) 09.5.6.
Jean-Paul Allouche and Jeffrey O. Shallit, Infinite products associated with counting blocks in binary strings, J. London Math. Soc.39 (1989) 193-204.
Jean-Paul Allouche and Jeffrey Shallit, Sums of digits and the Hurwitz zeta function, in: K. Nagasaka and E. Fouvry (eds.), Analytic Number Theory, Lecture Notes in Mathematics, Vol. 1434, Springer, Berlin, Heidelberg, 1990, pp. 19-30.
Alex S. A. Alochukwu, Audace A. V. Dossou-Olory, Fadekemi J. Osaye, Valisoa R. M. Rakotonarivo, Shashank Ravichandran, Sarah J. Selkirk, Hua Wang, and Hays Whitlatch, Characterization of Trees with Maximum Security, arXiv:2411.19188 [math.CO], 2024. See p. 12.
Khodabakhsh Hessami Pilehrood and Tatiana Hessami Pilehrood, Vacca-Type Series for Values of the Generalized Euler Constant Function and its Derivative, J. Integer Sequences, 13 (2010), Article 10.7.3.
Vladimir Shevelev, The number of permutations with prescribed up-down structure as a function of two variables, INTEGERS, Vol. 12 (2012), #A1. - From _N. J. A. Sloane_, Feb 07 2013
Ralf Stephan, Some divide-and-conquer sequences with (relatively) simple ordinary generating functions, 2004.
Ralf Stephan, Table of generating functions.
Ralf Stephan, Divide-and-conquer generating functions. I. Elementary sequences, arXiv:math/0307027 [math.CO], 2003.
Index entries for sequences related to binary expansion of n

The basic sequences concerning the binary expansion of n are A000120, A000788, A000069, A001969, A023416, A059015, A070939, A083652. Partial sums see A059015.
With initial zero and shifted right, same as A080791.
Cf. A055641 (for base 10), A188859.

a023416 0 = 1
a023416 1 = 0
a023416 n = a023416 n' + 1 - m where (n', m) = divMod n 2
a023416_list = 1 : c [0] where c (z:zs) = z : c (zs ++ [z+1,z])
-- Reinhard Zumkeller, Feb 19 2012, Jun 16 2011, Mar 07 2011

A023416 := proc(n)
    if n = 0 then
        1;
    else
        add(1-e,e=convert(n,base,2)) ;
    end if;
end proc: # R. J. Mathar, Jul 21 2012

Table[ Count[ IntegerDigits[n, 2], 0], {n, 0, 100} ]
DigitCount[Range[0,110],2,0] (* Harvey P. Dale, Jan 10 2013 *)

a(n)=if(n==0,1,n=binary(n); sum(i=1, #n, !n[i])) \\ Charles R Greathouse IV, Jun 10 2011

a(n)=if(n==0,1,#binary(n)-hammingweight(n)) \\ Charles R Greathouse IV, Nov 20 2012

a(n) = if(n == 0, 1, 1+logint(n,2) - hammingweight(n))  \\ Gheorghe Coserea, Sep 01 2015

def A023416(n): return n.bit_length()-n.bit_count() if n else 1 # Chai Wah Wu, Mar 13 2023

a(n) = 1, if n = 0; 0, if n = 1; a(n/2)+1 if n even; a((n-1)/2) if n odd.
a(n) = 1 - (n mod 2) + a(floor(n/2)). - Marc LeBrun, Jul 12 2001
G.f.: 1 + 1/(1-x) * Sum_{k>=0} x^(2^(k+1))/(1+x^2^k). - Ralf Stephan, Apr 15 2002
a(n) = A070939(n) - A000120(n).
a(n) = A008687(n+1) - 1.
a(n) = A000120(A035327(n)).
From Hieronymus Fischer, Jun 12 2012: (Start)
a(n) = m + 1 + Sum_{j=1..m+1} (floor(n/2^j) - floor(n/2^j + 1/2)), where m=floor(log_2(n)).
General formulas for the number of digits <= d in the base p representation n, where 0 <= d < p.
a(n) = m + 1 + Sum_{j=1..m+1} (floor(n/p^j) - floor(n/p^j + (p-d-1)/p)), where m=floor(log_p(n)).
G.f.: 1 + (1/(1-x))*Sum_{j>=0} ((1-x^(d*p^j))*x^p^j + (1-x^p^j)*x^p^(j+1)/(1-x^p^(j+1))). (End)
Product_{n>=1} ((2*n)/(2*n+1))^((-1)^a(n)) = sqrt(2)/2 (A010503) (see Allouche & Shallit link). - Michel Marcus, Aug 31 2014
Sum_{n>=1} a(n)/(n*(n+1)) = 2 - 2*log(2) (A188859) (Allouche and Shallit, 1990). - Amiram Eldar, Jun 01 2021

A014105 Second hexagonal numbers: a(n) = n(2n + 1).

Original entry on oeis.org

0, 3, 10, 21, 36, 55, 78, 105, 136, 171, 210, 253, 300, 351, 406, 465, 528, 595, 666, 741, 820, 903, 990, 1081, 1176, 1275, 1378, 1485, 1596, 1711, 1830, 1953, 2080, 2211, 2346, 2485, 2628, 2775, 2926, 3081, 3240, 3403, 3570, 3741, 3916, 4095, 4278

Offset: 0

N. J. A. Sloane, Jun 14 1998

Note that when starting from a(n)^2, equality holds between series of first n+1 and next n consecutive squares: a(n)^2 + (a(n) + 1)^2 + ... + (a(n) + n)^2 = (a(n) + n + 1)^2 + (a(n) + n + 2)^2 + ... + (a(n) + 2*n)^2; e.g., 10^2 + 11^2 + 12^2 = 13^2 + 14^2. - Henry Bottomley, Jan 22 2001; with typos fixed by Zak Seidov, Sep 10 2015
a(n) = sum of second set of n consecutive even numbers - sum of the first set of n consecutive odd numbers: a(1) = 4-1, a(3) = (8+10+12) - (1+3+5) = 21. - Amarnath Murthy, Nov 07 2002
Partial sums of odd numbers 3 mod 4, that is, 3, 3+7, 3+7+11, ... See A001107. - Jon Perry, Dec 18 2004
If Y is a fixed 3-subset of a (2n+1)-set X then a(n) is the number of (2n-1)-subsets of X intersecting Y. - Milan Janjic, Oct 28 2007
More generally (see the first comment), for n > 0, let b(n,k) = a(n) + k*(4*n + 1). Then b(n,k)^2 + (b(n,k) + 1)^2 + ... + (b(n,k) + n)^2 = (b(n,k) + n + 1 + 2*k)^2 + ... + (b(n,k) + 2*n + 2*k)^2 + k^2; e.g., if n = 3 and k = 2, then b(n,k) = 47 and 47^2 + ... + 50^2 = 55^2 + ... + 57^2 + 2^2. - Charlie Marion, Jan 01 2011
Sequence found by reading the line from 0, in the direction 0, 10, ..., and the line from 3, in the direction 3, 21, ..., in the square spiral whose vertices are the triangular numbers A000217. - Omar E. Pol, Nov 09 2011
a(n) is the number of positions of a domino in a pyramidal board with base 2n+1. - César Eliud Lozada, Sep 26 2012
Differences of row sums of two consecutive rows of triangle A120070, i.e., first differences of A016061. - J. M. Bergot, Jun 14 2013 [In other words, the partial sums of this sequence give A016061. - Leo Tavares, Nov 23 2021]
a(n)*Pi is the total length of half circle spiral after n rotations. See illustration in links. - Kival Ngaokrajang, Nov 05 2013
For corresponding sums in first comment by Henry Bottomley, see A059255. - Zak Seidov, Sep 10 2015
a(n) also gives the dimension of the simple Lie algebras B_n (n >= 2) and C_n (n >= 3). - Wolfdieter Lang, Oct 21 2015
With T_(i+1,i)=a(i+1) and all other elements of the lower triangular matrix T zero, T is the infinitesimal generator for unsigned A130757, analogous to A132440 for the Pascal matrix. - Tom Copeland, Dec 13 2015
Partial sums of squares with alternating signs, ending in an even term: a(n) = 0^2 - 1^2 +- ... + (2*n)^2, cf. Example & Formula from Berselli, 2013. - M. F. Hasler, Jul 03 2018
Also numbers k with the property that in the symmetric representation of sigma(k) the smallest Dyck path has a central peak and the largest Dyck path has a central valley, n > 0. (Cf. A237593.) - Omar E. Pol, Aug 28 2018
a(n) is the area of a triangle with vertices at (0,0), (2*n+1, 2*n), and ((2*n+1)^2, 4*n^2). - Art Baker, Dec 12 2018
This sequence is the largest subsequence of A000217 such that gcd(a(n), 2*n) = a(n) mod (2*n) = n, n > 0 up to a given value of n. It is the interleave of A033585 (a(n) is even) and A033567 (a(n) is odd). - Torlach Rush, Sep 09 2019
A generalization of Hasler's Comment (Jul 03 2018) follows. Let P(k,n) be the n-th k-gonal number. Then for k > 1, partial sums of {P(k,n)} with alternating signs, ending in an even term, = n*((k-2)*n + 1). - Charlie Marion, Mar 02 2021
Let U_n(H) = {A in M_n(H): A*A^H = I_n} be the group of n X n unitary matrices over the quaternions (A^H is the conjugate transpose of A. Note that over the quaternions we still have A*A^H = I_n <=> A^H*A = I_n by mapping A and A^H to (2n) X (2n) complex matrices), then a(n) is the dimension of its Lie algebra u_n(H) = {A in M_n(H): A + A^H = 0} as a real vector space. A basis is given by {(E_{st}-E_{ts}), i*(E_{st}+E_{ts}), j*(E_{st}+E_{ts}), k*(E_{st}+E_{ts}): 1 <= s < t <= n} U {i*E_{tt}, j*E_{tt}, k*E_{tt}: t = 1..n}, where E_{st} is the matrix with all entries zero except that its (st)-entry is 1. - Jianing Song, Apr 05 2021

			For n=6, a(6) = 0^2 - 1^2 + 2^2 - 3^2 + 4^2 - 5^2 + 6^2 - 7^2 + 8^2 - 9^2 + 10^2 - 11^2 + 12^2 = 78. - _Bruno Berselli_, Aug 29 2013

Louis Comtet, Advanced Combinatorics, Reidel, 1974, pp. 77-78. (In the integral formula on p. 77 a left bracket is missing for the cosine argument.)

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
Matthew Cho, Anton Dochtermann, Ryota Inagaki, Suho Oh, Dylan Snustad, and Bailee Zacovic, Chip-firing and critical groups of signed graphs, arXiv:2306.09315 [math.CO], 2023. See p. 22.
Robert FERREOL, Illustration: triangular numbers of even order
Guo-Niu Han, Enumeration of Standard Puzzles, 2011. [Cached copy]
Guo-Niu Han, Enumeration of Standard Puzzles, arXiv:2006.14070 [math.CO], 2020.
Milan Janjic, Two Enumerative Functions, University of Banja Luka (Bosnia and Herzegovina, 2017).
Ângela Mestre and José Agapito, Square Matrices Generated by Sequences of Riordan Arrays, J. Int. Seq., Vol. 22 (2019), Article 19.8.4.
Kival Ngaokrajang, Illustration of half circle spiral.
Markus Scheuer, show that; strange sum yields triangular numbers, Mathematics StackExchange.
Amelia Carolina Sparavigna, The groupoids of Mersenne, Fermat, Cullen, Woodall and other Numbers and their representations by means of integer sequences, Politecnico di Torino, Italy (2019).
Amelia Carolina Sparavigna, The groupoid of the Triangular Numbers and the generation of related integer sequences, Politecnico di Torino, Italy (2019).
Leo Tavares, Illustration: Squared Hexagons.
Index entries for two-way infinite sequences
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A000217, A000290, A000384, A002378, A002943, A100040, A100041, A081266, A144312.
Cf. A033567, A033585, A059255, A130757, A132440, A027907.
Second column of array A094416.
Equals A033586(n) divided by 4.
See Comments of A132124.
Second n-gonal numbers: A005449, A147875, A045944, A179986, A033954, A062728, A135705.
Row sums in triangle A253580.
Cf. A016061, A003215, A000290, A188859.

List([0..50],n->n*(2*n+1)); # Muniru A Asiru, Oct 31 2018

a014105 n = n * (2 * n + 1)
a014105_list = scanl (+) 0 a004767_list  -- Reinhard Zumkeller, Oct 03 2012

[ n*(2*n+1) : n in [0..50] ]; // Wesley Ivan Hurt, Jun 14 2014

seq(binomial(2*n+1,2), n=0..46); # Zerinvary Lajos, Jan 21 2007

Table[n*(2*n+1), {n,0,100}] (* Vladimir Joseph Stephan Orlovsky, Nov 16 2008 *)
LinearRecurrence[{3,-3,1},{0,3,10},50] (* Harvey P. Dale, Feb 10 2015 *)
CoefficientList[Series[x*(3 + x)/(1 - x)^3,{x, 0, 50}], x] (* Stefano Spezia, Sep 02 2018 *)

PARI
```
a(n)=n*(2*n+1)
```

[n*(2*n+1) for n in range(50)] # G. C. Greubel, Dec 16 2018

a(n) = 3*Sum_{k=1..n} tan^2(k*Pi/(2*(n + 1))). - Ignacio Larrosa Cañestro, Apr 17 2001
a(n)^2 = n*(a(n) + 1 + a(n) + 2 + ... + a(n) + 2*n); e.g., 10^2 = 2*(11 + 12 + 13 + 14). - Charlie Marion, Jun 15 2003
From N. J. A. Sloane, Sep 13 2003: (Start)
G.f.: x*(3 + x)/(1 - x)^3.
E.g.f.: exp(x)*(3*x + 2*x^2).
a(n) = A000217(2*n) = A000384(-n). (End)
a(n) = A084849(n) - 1; A100035(a(n) + 1) = 1. - Reinhard Zumkeller, Oct 31 2004
a(n) = A126890(n, k) + A126890(n, n-k), 0 <= k <= n. - Reinhard Zumkeller, Dec 30 2006
a(2*n) = A033585(n); a(3*n) = A144314(n). - Reinhard Zumkeller, Sep 17 2008
a(n) = a(n-1) + 4*n - 1 (with a(0) = 0). - Vincenzo Librandi, Dec 24 2010
a(n) = Sum_{k=0.2*n} (-1)^k*k^2. - Bruno Berselli, Aug 29 2013
a(n) = A242342(2*n + 1). - Reinhard Zumkeller, May 11 2014
a(n) = Sum_{k=0..2} C(n-2+k, n-2) * C(n+2-k, n), for n > 1. - J. M. Bergot, Jun 14 2014
a(n) = floor(Sum_{j=(n^2 + 1)..((n+1)^2 - 1)} sqrt(j)). Fractional portion of each sum converges to 1/6 as n -> infinity. See A247112 for a similar summation sequence on j^(3/2) and references to other such sequences. - Richard R. Forberg, Dec 02 2014
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n >= 3, with a(0) = 0, a(1) = 3, and a(2) = 10. - Harvey P. Dale, Feb 10 2015
Sum_{n >= 1} 1/a(n) = 2*(1 - log(2)) = 0.61370563888010938... (A188859). - Vaclav Kotesovec, Apr 27 2016
From Wolfdieter Lang, Apr 27 2018: (Start)
a(n) = trinomial(2*n, 2) = trinomial(2*n, 2*(2*n-1)), for n >= 1, with the trinomial irregular triangle A027907; i.e., trinomial(n,k) = A027907(n,k).
a(n) = (1/Pi) * Integral_{x=0..2} (1/sqrt(4 - x^2)) * (x^2 - 1)^(2*n) * R(4*(n-1), x), for n >= 0, with the R polynomial coefficients given in A127672, and R(-m, x) = R(m, x). [See Comtet, p. 77, the integral formula for q = 3, n -> 2*n, k = 2, rewritten with x = 2*cos(phi).] (End)
a(n) = A002943(n)/2. - Ralf Steiner, Jul 23 2019
a(n) = A000290(n) + A002378(n). - Torlach Rush, Nov 02 2020
a(n) = A003215(n) - A000290(n+1). See Squared Hexagons illustration. Leo Tavares, Nov 23 2021
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi/2 + log(2) - 2. - Amiram Eldar, Nov 28 2021

Link added and minor errors corrected by Johannes W. Meijer, Feb 04 2010

A093353 a(n) = (n + (n mod 2))*(n + 1)/2.

Original entry on oeis.org

0, 2, 3, 8, 10, 18, 21, 32, 36, 50, 55, 72, 78, 98, 105, 128, 136, 162, 171, 200, 210, 242, 253, 288, 300, 338, 351, 392, 406, 450, 465, 512, 528, 578, 595, 648, 666, 722, 741, 800, 820, 882, 903, 968, 990, 1058, 1081, 1152, 1176, 1250, 1275, 1352, 1378, 1458

Offset: 0

Reinhard Zumkeller, Apr 27 2004

Partial sums of A014682. - Paul Barry, Mar 31 2008
a(n) is the sum of all parts in the integer partitions of n+1 into two parts, see example. - Wesley Ivan Hurt, Jan 26 2013
Also the independence number of the n X n torus grid graph. - Eric W. Weisstein, Sep 06 2017
Also the number of circles we can draw on vertices of an (n+1)-sided regular polygon (using only a compass). - Matej Veselovac, Jan 21 2020

			a(1) = 2 since 2 = (1+1) and the sum of the first and second parts in the partition is 2; a(2) = 3 since 3 = (1+2) and the sum of these parts is 3; a(3) = 8 since 4 = (1+3) = (2+2) and the sum of all the parts is 8. - _Wesley Ivan Hurt_, Jan 26 2013

W. R. Hare, S. T. Hedetniemi, R. Laskar, and J. Pfaff, Complete coloring parameters of graphs, Proceedings of the sixteenth Southeastern international conference on combinatorics, graph theory and computing (Boca Raton, Fla., 1985). Congr. Numer., Vol. 48 (1985), pp. 171-178. MR0830709 (87h:05088). See s_m on page 135. - N. J. A. Sloane, Apr 06 2012

G. C. Greubel, Table of n, a(n) for n = 0..5000
Math StackExchange, Number of circles on vertices of a regular polygon, 2020.
Eric Weisstein's World of Mathematics, Independence Number.
Eric Weisstein's World of Mathematics, Torus Grid Graph.
Index entries for linear recurrences with constant coefficients, signature (1,2,-2,-1,1).

Cf. A000217, A001105, A014105, A014682, A072691, A188859, A242669.

[(n+1)*(2*n+1-(-1)^n)/4: n in [0..60]]; // Vincenzo Librandi, Jan 23 2020

a:= n-> (n+1)*floor((n+1)/2); seq(a(n), n = 0..70);

(* Contributions from Harvey P. Dale, Nov 15 2013: Start *)
Table[(n+Mod[n,2])*(n+1)/2,{n,0,60}]
LinearRecurrence[{1,2,-2,-1,1},{0,2,3,8,10},60]
Join[{0},Module[{nn = 60, ab}, ab = Transpose[ Partition[ Accumulate[ Range[nn]], 2]]; Flatten[ Transpose[ {ab[[1]] + Range[nn/2], ab[[2]]}]]]]
(* End *)

a(n)=(n+1)\2*(n+1) \\ Charles R Greathouse IV, Jun 11 2015

[(n+1)*int((n+1)//2) for n in range(0,71)] # G. C. Greubel, Mar 14 2024

a(2*n) = a(2*n-1) + n = A014105(n).
a(2*n+1) = a(2*n) + 3*n + 2 = A001105(n+1).
G.f.: x*(2+x+x^2)/((1-x)^3*(1+x)^2).
a(n) = (n+1)*(2*n+1-(-1)^n)/4. - Paul Barry, Mar 31 2008
a(n) = (n+1)*floor((n+1)/2). - Wesley Ivan Hurt, Jan 26 2013
a(n) = Sum_{i=1..floor((n+1)/2)} i + Sum_{i=ceiling((n+1)/2)..n} i. - Wesley Ivan Hurt, Jun 08 2013
From Amiram Eldar, Mar 10 2022: (Start)
Sum_{n>=1} 1/a(n) = Pi^2/12 + 2*(1-log(2)) = A072691 + A188859.
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi^2/12 - 2*(1-log(2)) = A072691 - A188859. (End)
E.g.f.: (x*(3 + x)*cosh(x) + (1 + x)^2*sinh(x))/2. - Stefano Spezia, Nov 13 2024

a(0)=0 prepended by Alois P. Heinz, Nov 13 2024

A244009 Decimal expansion of 1 - log(2).

Original entry on oeis.org

3, 0, 6, 8, 5, 2, 8, 1, 9, 4, 4, 0, 0, 5, 4, 6, 9, 0, 5, 8, 2, 7, 6, 7, 8, 7, 8, 5, 4, 1, 8, 2, 3, 4, 3, 1, 9, 2, 4, 4, 9, 9, 8, 6, 5, 6, 3, 9, 7, 4, 4, 7, 4, 5, 8, 7, 9, 3, 1, 9, 9, 9, 0, 5, 0, 6, 6, 0, 6, 3, 7, 8, 0, 3, 0, 3, 0, 5, 2, 8, 4, 3, 9, 4, 1, 3, 6, 6, 7, 3, 0, 0, 3, 5, 8, 1, 3, 1, 2, 4, 5, 7, 9, 9, 8, 5

Offset: 0

Franklin T. Adams-Watters, Jun 17 2014

Fraction of numbers which are sqrt-smooth, see A048098 and A063539. - Charles R Greathouse IV, Jul 14 2014

Asymptotic survival probability in the 100 prisoners problem. - Alois P. Heinz, Jul 08 2022

			0.30685281944005469058276787854...

Steven R. Finch, Mathematical Constants, Encyclopedia of Mathematics and its Applications, vol. 94, Cambridge University Press, 2003, Section 1.6.3, pp. 43-44.

Peter Bala, A continued fraction expansion for the constant 1 - log(2)
Donald E. Knuth and Luis Trabb Pardo, Analysis of a simple factorization algorithm, Theoretical Computer Science 3:3 (1976), pp. 321-348.
The Ramanujan Machine, Using algorithms to discover new mathematics.
Wikipedia, 100 prisoners problem
Index entries for transcendental numbers

Cf. A002162, A019739, A024168, A100381, A135002, A188859.

Essentially the same digits as A239354.

f:= sum(1/(2*k*(2*k+1)), k=1..infinity):
s:= convert(evalf(f, 140), string):
seq(parse(s[i+1]), i=1..106);  # Alois P. Heinz, Jun 17 2014

RealDigits[1-Log[2],10,120][[1]] (* Harvey P. Dale, Sep 23 2016 *)

1-log(2) \\ Charles R Greathouse IV, Jul 14 2014

Equals Sum_{k>=0} 1/(2*k*(2*k+1)) = A239354 + 1/4 = A188859/2.
From Amiram Eldar, Aug 07 2020: (Start)
Equals Sum_{k>=1} 1/(k*(k+1)*2^k) = Sum_{k>=2} 1/A100381(k).
Equals Sum_{k>=2} (-1)^k * zeta(k)/2^k.
Equals Integral_{x=1..oo} 1/(x^2 + x^3) dx. (End)
Equals log(e/2) = log(A019739) = -log(2/e) = -log(A135002). - Wolfdieter Lang, Mar 04 2022
Equals lim_{n->oo} A024168(n)/n!. - Alois P. Heinz, Jul 08 2022
Equals 1/(4 - 4/(7 - 12/(10 - ... - 2*n*(n-1)/((3*n+1) - ...)))) (an equivalent continued fraction for 1 - log(2) was conjectured by the Ramanujan machine). - Peter Bala, Mar 04 2024
Equals Sum_{k>=1} zeta(2*k)/((2*k + 1)*2^(2*k-1)) (see Finch). - Stefano Spezia, Nov 02 2024

A016639 Decimal expansion of log(16) = 4*log(2).

Original entry on oeis.org

2, 7, 7, 2, 5, 8, 8, 7, 2, 2, 2, 3, 9, 7, 8, 1, 2, 3, 7, 6, 6, 8, 9, 2, 8, 4, 8, 5, 8, 3, 2, 7, 0, 6, 2, 7, 2, 3, 0, 2, 0, 0, 0, 5, 3, 7, 4, 4, 1, 0, 2, 1, 0, 1, 6, 4, 8, 2, 7, 2, 0, 0, 3, 7, 9, 7, 3, 5, 7, 4, 4, 8, 7, 8, 7, 8, 7, 7, 8, 8, 6, 2, 4, 2, 3, 4, 5, 3, 3, 0, 7, 9, 8, 5, 6, 7, 4, 7, 5

Offset: 1

N. J. A. Sloane

			2.77258872223978123766892848583270627230200053744102101648272... - _Harry J. Smith_, May 17 2009

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 2.

Harry J. Smith, Table of n, a(n) for n = 1..20000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Peter Bala, A continued fraction expansion for the constant log(16)
Eric Weisstein's World of Mathematics, Madelung Constants.
Index entries for transcendental numbers

Equals 4*A002162.
Equals (4/5)*A016655.
Equals A303658 + 2.
Cf. A016444 (continued fraction).
Cf. A001008, A002805, A188859.

Log(16); // Vincenzo Librandi, Feb 20 2015

RealDigits[Log[16], 10, 120][[1]] (* Harvey P. Dale, Jun 12 2012 *)

default(realprecision, 20080); x=log(16); for (n=1, 20000, d=floor(x); x=(x-d)*10; write("b016639.txt", n, " ", d)); \\ Harry J. Smith, May 17 2009, corrected May 19 2009

Equals 4*A002162.
Equals Sum_{k=1..4} (-1)^(k+1) gamma(0, k/4) where gamma(n,x) denotes the generalized Stieltjes constants. - Peter Luschny, May 16 2018
Equals -2 + Sum_{k>=1} H(k)*(k+1)/2^k, where H(k) = A001008(k)/A002805(k) is the k-th harmonic number. - Amiram Eldar, May 28 2021
Equals 1 + Limit_{n -> infinity} (1/n)*Sum_{k = 1..n} (2*n + k)/(2*n - k) = 2*( 1 + Limit_{n -> infinity} (1/n)*Sum_{k = 1..n} (n - k)/(n + k) ). - Peter Bala, Oct 10 2021
Equals 2 + 1/(1 + 1/(3 + 2/(4 + 6/(5 + 6/(6 + 12/(7 + 12/(8 + ... + n*(n-1)/(2*n-1 + n*(n-1)/(2*n + ...))))))))). Cf. A188859. - Peter Bala, Mar 04 2024

cp's OEIS Frontend

A023416 Number of 0's in binary expansion of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

PARI

PARI

Python

Formula

A014105 Second hexagonal numbers: a(n) = n*(2*n + 1).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

Sage

Formula

Extensions

A093353 a(n) = (n + (n mod 2))*(n + 1)/2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

SageMath

Formula

Extensions

A244009 Decimal expansion of 1 - log(2).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A016639 Decimal expansion of log(16) = 4*log(2).

Views

Author

Keywords

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A014105 Second hexagonal numbers: a(n) = n(2n + 1).