A091476 -id:A091476 - cp's OEIS frontend

A006519 Highest power of 2 dividing n.

1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 16, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 32, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 16, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 64, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 16, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 32, 1, 2, 1, 4, 1, 2

Offset: 1

N. J. A. Sloane, Simon Plouffe

Least positive k such that m^k + 1 divides m^n + 1 (with fixed base m). - Vladimir Baltic, Mar 25 2002
To construct the sequence: start with 1, concatenate 1, 1 and double last term gives 1, 2. Concatenate those 2 terms, 1, 2, 1, 2 and double last term 1, 2, 1, 2 -> 1, 2, 1, 4. Concatenate those 4 terms: 1, 2, 1, 4, 1, 2, 1, 4 and double last term -> 1, 2, 1, 4, 1, 2, 1, 8, etc. - Benoit Cloitre, Dec 17 2002
a(n) = gcd(seq(binomial(2*n, 2*m+1)/2, m = 0 .. n - 1)) (odd numbered entries of even numbered rows of Pascal's triangle A007318 divided by 2), where gcd() denotes the greatest common divisor of a set of numbers. Due to the symmetry of the rows it suffices to consider m = 0 .. floor((n-1)/2). - Wolfdieter Lang, Jan 23 2004
Equals the continued fraction expansion of a constant x (cf. A100338) such that the continued fraction expansion of 2*x interleaves this sequence with 2's: contfrac(2*x) = [2; 1, 2, 2, 2, 1, 2, 4, 2, 1, 2, 2, 2, 1, 2, 8, 2, ...].
Simon Plouffe observes that this sequence and A003484 (Radon function) are very similar, the difference being all zeros except for every 16th term (see A101119 for nonzero differences). Dec 02 2004
This sequence arises when calculating the next odd number in a Collatz sequence: Next(x) = (3*x + 1) / A006519, or simply (3*x + 1) / BitAnd(3*x + 1, -3*x - 1). - Jim Caprioli, Feb 04 2005
a(n) = n if and only if n = 2^k. This sequence can be obtained by taking a(2^n) = 2^n in place of a(2^n) = n and using the same sequence building approach as in A001511. - Amarnath Murthy, Jul 08 2005
Also smallest m such that m + n - 1 = m XOR (n - 1); A086799(n) = a(n) + n - 1. - Reinhard Zumkeller, Feb 02 2007
Number of 1's between successive 0's in A159689. - Philippe Deléham, Apr 22 2009
Least number k such that all coefficients of k*E(n, x), the n-th Euler polynomial, are integers (cf. A144845). - Peter Luschny, Nov 13 2009
In the binary expansion of n, delete everything left of the rightmost 1 bit. - Ralf Stephan, Aug 22 2013
The equivalent sequence for partitions is A194446. - Omar E. Pol, Aug 22 2013
Also the 2-adic value of 1/n, n >= 1. See the Mahler reference, definition on p. 7. This is a non-archimedean valuation. See Mahler, p. 10. Sometimes called 2-adic absolute value of 1/n. - Wolfdieter Lang, Jun 28 2014
First 2^(k-1) - 1 terms are also the heights of the successive rectangles and squares of width 2 that are adjacent to any of the four sides of the toothpick structure of A139250 after 2^k stages, with k >= 2. For example: if k = 5 the heights after 32 stages are [1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1] respectively, the same as the first 15 terms of this sequence. - Omar E. Pol, Dec 29 2020

			2^3 divides 24, but 2^4 does not divide 24, so a(24) = 8.
2^0 divides 25, but 2^1 does not divide 25, so a(25) = 1.
2^1 divides 26, but 2^2 does not divide 26, so a(26) = 2.
Per _Marc LeBrun_'s 2000 comment, a(n) can also be determined with bitwise operations in two's complement. For example, given n = 48, we see that n in binary in an 8-bit byte is 00110000 while -n is 11010000. Then 00110000 AND 11010000 = 00010000, which is 16 in decimal, and therefore a(48) = 16.
G.f. = x + 2*x^2 + x^3 + 4*x^4 + x^5 + 2*x^6 + x^7 + 8*x^8 + x^9 + ...

Kurt Mahler, p-adic numbers and their functions, second ed., Cambridge University Press, 1981.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 1..10000
Dzmitry Badziahin and Jeffrey Shallit, An Unusual Continued Fraction, arXiv:1505.00667 [math.NT], 2015.
Dzmitry Badziahin and Jeffrey Shallit, An unusual continued fraction, Proc. Amer. Math. Soc. 144 (2016), 1887-1896.
Tyler Ball, Tom Edgar, and Daniel Juda, Dominance Orders, Generalized Binomial Coefficients, and Kummer's Theorem, Mathematics Magazine, Vol. 87, No. 2, April 2014, pp. 135-143.
M. Beeler, R. W. Gosper and R. Schroeppel, Item 175, in Beeler, M., Gosper, R. W. and Schroeppel, R. HAKMEM. MIT AI Memo 239, Feb 29 1972.
Ron Brown and Jonathan L. Merzel, The number of Ducci sequences with a given period, Fib. Quart., 45 (2007), 115-121.
Daniel Bruns, Wojciech Mostowski, and Mattias Ulbrich, Implementation-level verification of algorithms with KeY, International Journal on Software Tools for Technology Transfer, November 2013.
Victor Meally, Letter to N. J. A. Sloane, May 1975.
Laurent Orseau, Levi H. S. Lelis, and Tor Lattimore, Zooming Cautiously: Linear-Memory Heuristic Search With Node Expansion Guarantees, arXiv:1906.03242 [cs.AI], 2019.
Laurent Orseau, Levi H. S. Lelis, Tor Lattimore, and Théophane Weber, Single-Agent Policy Tree Search With Guarantees, arXiv:1811.10928 [cs.AI], 2018, also in Advances in Neural Information Processing Systems, 32nd Conference on Neural Information Processing Systems (NIPS 2018), Montréal, Canada.
Ralf Stephan, Some divide-and-conquer sequences with (relatively) simple ordinary generating functions.
Ralf Stephan, Table of generating functions.
Ralf Stephan, Divide-and-conquer generating functions. I. Elementary sequences, arXiv:math/0307027 [math.CO], 2003.
Eric Weisstein's World of Mathematics, Even Part.
Wikipedia, Converse nonimplication.
Index entries for sequences related to binary expansion of n.

Partial sums are in A006520, second partial sums in A022560.
Sequences used in definitions of this sequence: A000079, A001511, A004198, A007814.
Cf. A000265, A100338, A003484, A001620, A101119, A002487, A139250.
Sequences with related definitions: A038712, A171977, A135481 (GS(1, 6)).
This is Guy Steele's sequence GS(5, 2) (see A135416).
Related to A007913 via A225546.
A059897 is used to express relationship between sequence terms.
Cf. A091476 (Dgf at s=2).

import Data.Bits ((.&.))
a006519 n = n .&. (-n) :: Integer
-- Reinhard Zumkeller, Mar 11 2012, Dec 29 2011

using IntegerSequences
[EvenPart(n) for n in 1:102] |> println  # Peter Luschny, Sep 25 2021

[2^Valuation(n, 2): n in [1..100]]; // Vincenzo Librandi, Mar 27 2015

with(numtheory): for n from 1 to 200 do if n mod 2 = 1 then printf(`%d,`,1) else printf(`%d,`,2^ifactors(n)[2][1][2]) fi; od:
A006519 := proc(n) if type(n,'odd') then 1 ; else for f in ifactors(n)[2] do if op(1,f) = 2 then return 2^op(2,f) ; end if; end do: end if; end proc: # R. J. Mathar, Oct 25 2010
A006519 := n -> 2^padic[ordp](n,2): # Peter Luschny, Nov 26 2010

lowestOneBit[n_] := Block[{k = 0}, While[Mod[n, 2^k] == 0, k++]; 2^(k - 1)]; Table[lowestOneBit[n], {n, 102}] (* Robert G. Wilson v Nov 17 2004 *)
Table[2^IntegerExponent[n, 2], {n, 128}] (* Jean-François Alcover, Feb 10 2012 *)
Table[BitAnd[BitNot[i - 1], i], {i, 1, 102}] (* Peter Luschny, Oct 10 2019 *)

PARI
```
{a(n) = 2^valuation(n, 2)};
```
PARI
```
a(n)=1<Joerg Arndt, Jun 10 2011
```

a(n)=bitand(n,-n); \\ Joerg Arndt, Jun 10 2011

a(n)=direuler(p=2,n,if(p==2,1/(1-2*X),1/(1-X)))[n] \\ Ralf Stephan, Mar 27 2015

def A006519(n): return n&-n # Chai Wah Wu, Jul 06 2022

(1 to 128).map(Integer.lowestOneBit()) // _Alonso del Arte, Mar 04 2020

a(n) = n AND -n (where "AND" is bitwise, and negative numbers are represented in two's complement in a suitable bit width). - Marc LeBrun, Sep 25 2000, clarified by Alonso del Arte, Mar 16 2020
Also: a(n) = gcd(2^n, n). - Labos Elemer, Apr 22 2003
Multiplicative with a(p^e) = p^e if p = 2; 1 if p > 2. - David W. Wilson, Aug 01 2001
G.f.: Sum_{k>=0} 2^k*x^2^k/(1 - x^2^(k+1)). - Ralf Stephan, May 06 2003
Dirichlet g.f.: zeta(s)*(2^s - 1)/(2^s - 2) = zeta(s)*(1 - 2^(-s))/(1 - 2*2^(-s)). - Ralf Stephan, Jun 17 2007
a(n) = 2^floor(A002487(n - 1) / A002487(n)). - Reikku Kulon, Oct 05 2008
a(n) = 2^A007814(n). - R. J. Mathar, Oct 25 2010
a((2*k - 1)*2^e) = 2^e, k >= 1, e >= 0. - Johannes W. Meijer, Jun 07 2011
a(n) = denominator of Euler(n-1, 1). - Arkadiusz Wesolowski, Jul 12 2012
a(n) = A011782(A001511(n)). - Omar E. Pol, Sep 13 2013
a(n) = (n XOR floor(n/2)) XOR (n-1 XOR floor((n-1)/2)) = n - (n AND n-1) (where "AND" is bitwise). - Gary Detlefs, Jun 12 2014
a(n) = ((n XOR n-1)+1)/2. - Gary Detlefs, Jul 02 2014
a(n) = A171977(n)/2. - Peter Kern, Jan 04 2017
a(n) = 2^(A001511(n)-1). - Doug Bell, Jun 02 2017
a(n) = abs(A003188(n-1) - A003188(n)). - Doug Bell, Jun 02 2017
Conjecture: a(n) = (1/(A000203(2*n)/A000203(n)-2)+1)/2. - Velin Yanev, Jun 30 2017
a(n) = (n-1) o n where 'o' is the bitwise converse nonimplication. 'o' is not commutative. n o (n+1) = A135481(n). - Peter Luschny, Oct 10 2019
From Peter Munn, Dec 13 2019: (Start)
a(A225546(n)) = A225546(A007913(n)).
a(A059897(n,k)) = A059897(a(n), a(k)). (End)
Sum_{k=1..n} a(k) ~ (1/(2*log(2)))*n*log(n) + (3/4 + (gamma-1)/(2*log(2)))*n, where gamma is Euler's constant (A001620). - Amiram Eldar, Nov 15 2022
a(n) = n / A000265(n). - Amiram Eldar, May 22 2025

More terms from James Sellers, Jun 20 2000

A111003 Decimal expansion of Pi^2/8.

Original entry on oeis.org

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

Offset: 1

Sam Alexander, Oct 01 2005

According to Beckmann, Euler discovered the formula for this number as a sum of squares of reciprocals of odd numbers, along with similar formulas for Pi^2/6 and Pi^2/12. - Alonso del Arte, Apr 01 2013

Equals the asymptotic mean of the abundancy index of the odd numbers. - Amiram Eldar, May 12 2023

			1.23370055013616982735431137498451889191421242590509882830166867202...
1 + 1/9 + 1/25 + 1/49 + 1/81 + 1/121 + 1/169 + 1/225 + ... - _Bruno Berselli_, Mar 06 2017

F. Aubonnet, D. Guinin and B. Joppin, Précis de Mathématiques, Analyse 2, Classes Préparatoires, Premier Cycle Universitaire, Bréal, 1990, Exercice 908, pages 82 and 91-92.
Petr Beckmann, A History of Pi, 5th Ed. Boulder, Colorado: The Golem Press (1982): p. 153.
George Boros and Victor H. Moll, Irresistible integrals, Cambridge University Press (2006), p. 122.
Calvin C. Clawson, The Beauty and Magic of Numbers. New York: Plenum Press (1996): 98.
L. B. W. Jolley, Summation of Series, Dover (1961).
David Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, Revised edition 1987. See p. 54.

Eric Weisstein's World of Mathematics, Dirichlet Lambda Function. See (5).
Index entries for transcendental numbers

Cf. A013661 (Pi^2/6), A002388, A102753, A091476, A309891.

RealDigits[Pi^2/8, 10, 105][[1]] (* Robert G. Wilson v *)

Pi^2/8 \\ Charles R Greathouse IV, Dec 04 2016

sumpos(n=1,(2*n-1)^-2) \\ Charles R Greathouse IV, Mar 02 2018

Equals 1 + 1/(2*3) + (1/3)*(1*2)/(3*5) + (1/4)*(1*2*3)/(3*5*7) + ... [Jolley eq 276]
Equals Sum_{k >= 1} 1/(2*k - 1)^2 [Clawson and Wells]. - Alonso del Arte, Aug 15 2012
Equals 2*(Integral_{t=0..1} sqrt(1 - t^2) dt)^2. - Alonso del Arte, Mar 29 2013
Equals Sum_{k >= 1} 2^k/(k^2*binomial(2*k, k)). - Jean-François Alcover, Apr 29 2013
Equals Integral_{x=0..1} log((1+x^2)/(1-x^2))/x dx. - Bruno Berselli, May 13 2013
Equals limit_{p->0} Integral_{x=0..Pi/2} x*tan(x)^p dx. [Jean-François Alcover, May 17 2013, after Boros & Moll p. 230]
Equals A002388/8 = A102753/4 = A091476/2. - R. J. Mathar, Oct 13 2015
Equals Integral_{x>=0} x*K_0(x)*K_1(x)dx where K are modified Bessel functions [Gradsteyn-Ryzhik 6.576.4]. - R. J. Mathar, Oct 22 2015
Equals (3/4)*zeta(2) = (3/4)*A013661. - Wolfdieter Lang, Sep 02 2019
From Amiram Eldar, Jul 17 2020: (Start)
Equals -Integral_{x=0..1} log(x)/(1 - x^2) dx = Integral_{x>=1} log(x)/(x^2-1) dx.
Equals -Integral_{x=0..oo} log(x)/(1 - x^4) dx.
Equals Integral_{x=0..oo} arctan(x)/(1 + x^2) dx. (End)
Equals Integral_{x=0..1} log(1+x+x^2+x^3)/x dx (Aubonnet). - Bernard Schott, Feb 04 2022
Equals Sum_{n>=1} A309891(n)/n^2. - Friedjof Tellkamp, Jan 25 2025
Equals lambda(2), where lambda is the Dirichlet lambda function. - Michel Marcus, Aug 15 2025

More terms from Robert G. Wilson v, Oct 04 2005

A164102 Decimal expansion of 2*Pi^2.

Original entry on oeis.org

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

Offset: 2

R. J. Mathar, Aug 10 2009

Surface area of the 4-dimensional unit sphere. The volume of the 4-dimensional unit sphere is a fourth of this, A102753.

Also decimal expansion of Pi^2/5 = 1.973920..., with offset 1. - Omar E. Pol, Oct 04 2011

			19.739208802178717237668981...

L. A. Santalo, Integral Geometry and Geometric Probability, Addison-Wesley, 1976, see p. 15.

G. C. Greubel, Table of n, a(n) for n = 2..5000
Yann Bernard, Autour des surfaces de Willmore, Images des Mathématiques, CNRS, 2014 (in French).
Fernando C. Marques and André Neves, Min-Max theory and the Willmore conjecture, arXiv:1202.6036 [math.DG], 2012-2013.
H.-J. Seiffert, Problem B-705, Elementary Problems and Solutions, The Fibonacci Quarterly, Vol. 29, No. 4 (1991), p. 372; An Application of a Series Expansion for (arcsinx)^2, Solution to Problem B-705, ibid., Vol. 31, No. 1 (1993), pp. 85-86.
Eric Weisstein's World of Mathematics, Hypersphere.
Wikipedia, Hypersphere.
Wikipedia, Willmore conjecture.
Index entries for transcendental numbers.

Cf. A000032, A002388, A002736, A005248, A091476, A013661.

RealDigits[2*Pi^2,10,120][[1]] (* Harvey P. Dale, Apr 19 2012 *)

2*Pi^2 \\ Charles R Greathouse IV, Jan 24 2014

Equals 2*A002388 = 4*A102753.

Pi^2/5 = Sum_{k>=1} Lucas(2*k)/(k^2*binomial(2*k,k)) = Sum_{k>=1} A005248(k)/A002736(k) (Seiffert, 1991). - Amiram Eldar, Jan 17 2022

A195055 Decimal expansion of Pi^2/3.

Original entry on oeis.org

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

Offset: 1

Omar E. Pol, Oct 04 2011

			3.289868133696452872944830333292050378438...

Marc Briane and Gilles Pagès, Théorie de l'Intégration, Vuibert, 2004, 3ème édition, exercice 12.15, p. 256.

George E. Andrews, Partitions with short sequences and mock theta functions, Proceedings of the National Academy of Sciences, Vol. 102, No. 13 (2005), pp. 4666-4671.
Index entries for transcendental numbers

Cf. A002388, A102753, A091476, 2*A013661, A164102.
Cf. A024916 (partial sums of A000203).
Cf. A001008/A002805, A145426.

pi:=Pi(RealField(110)); Reverse(Intseq(Floor(10^105*pi^2/3))); // Vincenzo Librandi, Jan 12 2016

RealDigits[Pi^2/3, 10, 105][[1]] (* T. D. Noe, Oct 05 2011 *)

2*zeta(2) \\ Charles R Greathouse IV, Jan 20 2022

sumnumrat(1/x^2,-oo) \\ Charles R Greathouse IV, Jan 20 2022

Equals 3 + A145426.
Equals -Sum_{n>=1} Psi_2(n), where Psi_2 is the tetragamma function. - Istvan Mezo, Oct 25 2012
Equals Integral_{x=0..1} (log(x)/(x - 1))^2 dx. - Jean-François Alcover, Mar 21 2013
Equals Integral_{x=-oo..oo} x^2/sinh(x)^2 dx. - Amiram Eldar, Aug 06 2020
Equals Integral_{x=0..oo} (log(x+1)/x)^2 dx (reference Briane and Pagès). - Bernard Schott, Feb 13 2022
Equals Sum_{n>=1} H(n) * binomial(2*n, n) / (n * 4^n), where H(n) is the n-th harmonic number. - Antonio Graciá Llorente, Apr 04 2025

Extended by T. D. Noe, Oct 05 2011

A253191 Decimal expansion of log(2)^2.

Original entry on oeis.org

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

Offset: 0

Jean-François Alcover, Mar 24 2015

			0.480453013918201424667102526326664971730552951594545586866864...

David H. Bailey, Jonathan M. Borwein and Richard E. Crandall, On the Khintchine Constant, Mathematics of Computation, Vol. 66, No. 217 (1997), pp. 417-431, see p. 419; alternative link, p. 4.
Index entries for transcendental numbers

Cf. A001008, A002162, A002805, A175478.

Mathematica
```
RealDigits[Log[2]^2, 10, 103] // First
```

log(2)^2 \\ Charles R Greathouse IV, Apr 20 2016

Integral_{0..1} log(1-x^2)/(x*(1+x)) dx = -log(2)^2.
Integral_{0..1} log(log(1/x))/(x+sqrt(x)) dx = log(2)^2.
Equals Sum_{k>=1} H(k)/(2^k * (k+1)) = 2 * Sum_{k>=1} (-1)^(k+1) * H(k)/(k+1), where H(k) = A001008(k)/A002805(k) is the k-th harmonic number. - Amiram Eldar, Aug 05 2020
Equals Sum_{n >= 0} (-1)^n/(2^(n+1)*(n+1)^2*binomial(2*n+1,n)). See my entry in A002544 dated Apr 18 2017. Cf. A091476. - Peter Bala, Jan 30 2023
Equals 2*Integral_{x=-1..1} (abs(x)*log(x^2 + 1))/(x^2 + 1) dx. - Kritsada Moomuang, May 27 2025

A214549 Decimal expansion of 4*Pi^2/27.

Original entry on oeis.org

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

Offset: 1

R. J. Mathar, Jul 20 2012

Represents the value of the Dirichlet series for A011655 (principal Dirichlet character mod 3) at s=2.

Equals the asymptotic mean of the abundancy index of the numbers that are not divisible by 3 (A001651). - Amiram Eldar, May 12 2023

			1.4621636149762012768643690370186...

G. C. Greubel, Table of n, a(n) for n = 1..10000
R. J. Mathar, Table of Dirichlet L-Series, arXiv:1008.2547 [math.NT], 2010-2015, Table 22.
Index entries for transcendental numbers.

Cf. A001651, A011655, A100044.

using Nemo
R = RealField(310)
t = const_pi(RR) + const_pi(RR); s = t * t
s / RR(27) |> println # Peter Luschny, Mar 13 2018

R:= RealField(); 4*Pi(R)^2/27; // G. C. Greubel, Mar 08 2018

R:=RealField(106); SetDefaultRealField(R); n:=4*Pi(R)^2/27; Reverse(Intseq(Floor(10^105*n))); // Bruno Berselli, Mar 13 2018

Maple
```
evalf(4*Pi^2/27) ;
```

RealDigits[(4Pi^2)/27,10,120][[1]] (* Harvey P. Dale, Dec 20 2012 *)

4*Pi^2/27 \\ G. C. Greubel, Mar 08 2018

Equals (4/3)*A100044.
Equals Sum_{n>=0} (1/(3*n+1)^2 + 1/(3*n+2)^2).
From Peter Luschny, May 13 2020: (Start)
Equals (8/9) * Sum_(k>=1) 1/k^2 =8/9 *A013661.
Equals -(16/9) * Sum_(k>=1) (-1)^k/k^2 = -16/9 * A072691.
Equals (64/27) * ( Integral_{x=0..1} sqrt(1 - x^2) )^2 = 64/27 * A091476. (End)
Equals Integral_{x=0..oo} log(x)/(x^3 - 1) dx. - Amiram Eldar, Aug 12 2020

A353908 Decimal expansion of Pi^2/36.

Original entry on oeis.org

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

Offset: 0

Omar E. Pol, May 10 2022

Ratio between the volume of the stepped pyramid with an infinite number of levels described in A245092 and that of the circumscribed cube (see the first formula).
See also Vaclav Kotesovec's formula (2016) in A175254.
Volume shared by a sphere inscribed in a cube of volume Pi and one of the six pyramids inscribed in the cube. - Omar E. Pol, Sep 01 2024

			0.2741556778080377394120691944410041982031583168677997396225930382283345784...

Index entries for transcendental numbers

Cf. A000203, A000796, A002388, A013661, A019673, A021040, A024916, A072691, A086463, A086729, A091476, A100044, A102753, A175254, A195055, A237271, A237593, A245092.

evalf(Pi^2/36, 121);  # Alois P. Heinz, May 11 2022

RealDigits[Pi^2/36, 10, 100][[1]] (* Amiram Eldar, May 11 2022 *)

PARI
```
Pi^2/36
```
PARI
```
zeta(2)/6
```

Equals lim_{n->oo} A175254(n)/n^3.
Equals A002388/36.
Equals A102753/18.
Equals A195055/12.
Equals A091476/9.
Equals A013661/6.
Equals A100044/4.
Equals A072691/3.
Equals A086463/2.
Equals A086729*2.
Equals A019673^2.
Equals A002388*A021040.
Equals Re(dilog((1+sqrt(3)*i)/2)). - Mohammed Yaseen, Jul 03 2024

A065704 Number of squares or twice squares dividing n.

Original entry on oeis.org

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

Offset: 1

Vladeta Jovovic, Dec 04 2001

			divisors(36) = {1, 2, 3, 4, 6, 9, 12, 18, 36}, thus a(36) = #{1, 2, 4, 9, 18, 36}=6. a(36) = 1/2*(tau(36)-((-1)^sigma(1)+(-1)^sigma(2)+(-1)^sigma(3)+(-1)^sigma(4)+(-1)^sigma(6)+(-1)^sigma(9)+(-1)^sigma(12)+(-1)^sigma(18)+(-1)^sigma(36))) = 1/2*(9-(-3)) = 6. a(36) = a(2^2*3^2) = a(2^2)*a(3^2) = (2+1)*(1+1) = 6.

Carl R. White, Table of n, a(n) for n = 1..10000

Cf. A000203, A028982, A046951, A091476.

Cf. A000265, A004709.

f[n_] := Total[1 - (-1)^DivisorSigma[1, Divisors@n]]/2; Array[f, 105] (* Robert G. Wilson v, Jan 02 2013 *)
f[p_, e_] := If[p == 2, e+1, Floor[e/2] + 1]; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Sep 25 2022 *)

a(n) = {my(e = valuation(n, 2), o = n>>e, f = factor(o)); (e+1)*prod(i=1 , #f~, floor(f[i,2]/2)+1)}; \\ Amiram Eldar, Sep 25 2022

a(n) = (1/2)*Sum_{ d divides n } (1-(-1)^sigma(d)).
Multiplicative with a(2^e) = e+1 and a(p^e) = floor(e/2)+1 for an odd prime p.
a(n) = A005361(2*n) for n>0 (conjectured). - Werner Schulte, Jan 15 2018 [This is true only for numbers whose odd part (A000265) is cubefree (A004709). Therefore, the least counterexample is n=3^3=27: a(27) = 2 while A005361(2*27) = 3. - Amiram Eldar, Sep 25 2022]
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Pi^2/4 (A091476). - Amiram Eldar, Sep 25 2022

More terms from David Wasserman, Sep 09 2002

A069562 Numbers, m, whose odd part (largest odd divisor, A000265(m)) is a nontrivial square.

Original entry on oeis.org

9, 18, 25, 36, 49, 50, 72, 81, 98, 100, 121, 144, 162, 169, 196, 200, 225, 242, 288, 289, 324, 338, 361, 392, 400, 441, 450, 484, 529, 576, 578, 625, 648, 676, 722, 729, 784, 800, 841, 882, 900, 961, 968, 1058, 1089, 1152, 1156, 1225, 1250, 1296, 1352, 1369

Offset: 1

Benoit Cloitre, Apr 18 2002

Previous name: sum(d|n,6d/(2+mu(d))) is odd, where mu(.) is the Moebius function, A008683.
From Peter Munn, Jul 06 2020: (Start)
Numbers that have an odd number of odd nonsquarefree divisors.
[Proof of equivalence to the name, where m denotes a positive integer:
(1) These properties are equivalent: (a) m has an even number of odd squarefree divisors; (b) m has a nontrivial odd part.
(2) These properties are equivalent: (a) m has an odd number of odd divisors; (b) the odd part of m is square.
(3) m satisfies the condition at the start of this comment if and only if (1)(a) and (2)(a) are both true or both false.
(4) The trivial odd part, 1, is a square, so (1)(b) and (2)(b) cannot both be false, which (from (1), (2)) means (1)(a) and (2)(a) cannot both be false.
(5) From (3), (4), m satisfies the condition at the start of this comment if and only if (1)(a) and (2)(a) are true.
(6) m satisfies the condition in the name if and only if (1)(b) and (2)(b) are true, which (from (1), (2)) is equivalent to (1)(a) and (2)(a) being true, and hence from (5), to m satisfying the condition at the start of this comment.]
(End)
Numbers whose sum of non-unitary divisors (A048146) is odd. - Amiram Eldar, Sep 16 2024

			To determine the odd part of 18, remove all factors of 2, leaving 9. 9 is a nontrivial square, so 18 is in the sequence. - _Peter Munn_, Jul 06 2020

David A. Corneth, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Odd part.

A000265, A008683 are used in definitions of this sequence.
Lists of numbers whose odd part satisfies other conditions: A028982 (square), A028983 (nonsquare), A029747 (less than 6), A029750 (less than 8), A036349 (even number of prime factors), A038550 (prime), A070776 U {1} (power of a prime), A072502 (square of a prime), A091067 (has form 4k+3), A091072 (has form 4k+1), A093641 (noncomposite), A105441 (composite), A116451 (greater than 4), A116882 (less than or equal to even part), A116883 (greater than or equal to even part), A122132 (squarefree), A229829 (7-rough), A236206 (11-rough), A260488\{0} (has form 6k+1), A325359 (proper prime power), A335657 (odd number of prime factors), A336101 (prime power).
Cf. A048146, A091476.

Select[Range[1000], (odd = #/2^IntegerExponent[#, 2]) > 1 && IntegerQ @ Sqrt[odd] &] (* Amiram Eldar, Sep 29 2020 *)

upto(n) = { my(res = List()); forstep(i = 3, sqrtint(n), 2, for(j = 0, logint(n\i^2, 2), listput(res, i^2<David A. Corneth, Sep 28 2020

Sum_{n>=1} 1/a(n) = 2 * Sum_{k>=1} 1/(2*k+1)^2 = Pi^2/4 - 2 = A091476 - 2 = 0.467401... - Amiram Eldar, Feb 18 2021

New name from Peter Munn, Jul 06 2020

cp's OEIS Frontend

A006519 Highest power of 2 dividing n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Julia

Magma

Maple

Mathematica

PARI

PARI

PARI

PARI

Python

Scala

Formula

Extensions

A111003 Decimal expansion of Pi^2/8.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

Extensions

A164102 Decimal expansion of 2*Pi^2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A195055 Decimal expansion of Pi^2/3.

Views

Author

Keywords

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

Formula

Extensions

A253191 Decimal expansion of log(2)^2.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A214549 Decimal expansion of 4*Pi^2/27.

Views