login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A055064 a(n) = A004125(2^n) = A004125(2^n-1). 1

%I #21 Oct 24 2023 03:25:20

%S 0,1,8,36,167,693,2849,11459,46244,185622,743759,2974937,11907026,

%T 47643438,190606963,762449101,3049917900,12199777048,48799551822,

%U 195198666492,780796575104,3123189865122,12492766610068,49971069327602,199884317492186,799537344955292

%N a(n) = A004125(2^n) = A004125(2^n-1).

%H Chai Wah Wu, <a href="/A055064/b055064.txt">Table of n, a(n) for n = 1..77</a>

%F a(n) >= A006516(n-1). - _R. J. Mathar_, Apr 04 2012

%o (Python)

%o from math import isqrt

%o def A055064(n): return ((m:=1<<n)<<n)+((s:=isqrt(m))**2*(s+1)-sum((q:=m//k)*((k<<1)+q+1) for k in range(1,s+1))>>1) # _Chai Wah Wu_, Oct 22 2023

%Y Cf. A004125, A006516, A120444.

%K nonn

%O 1,3

%A _David W. Wilson_, Jun 12 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)