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!)
A181904 a(n) = 2*(4^n - 1) / A027760(n) 1

%I #22 Feb 23 2021 08:20:02

%S 3,5,63,17,1023,195,16383,4369,262143,31775,4194303,12291,67108863,

%T 89478485,1073741823,16843009,17179869183,172229265,274877906943,

%U 6663706835,4398046511103,254959218035,70368744177663,206208774147,1125899906842623,1501199875790165

%N a(n) = 2*(4^n - 1) / A027760(n)

%C The Clausen numbers A027760 divide 2*(4^n - 1).

%H Thomas Clausen, <a href="https://doi.org/10.1002/asna.18400172205">Lehrsatz aus einer Abhandlung ueber die Bernoulli'schen Zahlen</a>, Astr. Nachr. 17 (1840), 351-352.

%H Ludwig Seidel, <a href="http://publikationen.badw.de/de/003384831/pdf/CC%20BY">Über eine einfache Entstehungsweise der Bernoullischen Zahlen und einiger verwandten Reihen</a>, Sitzungsberichte der mathematisch-physikalischen Classe der königlich bayerischen Akademie der Wissenschaften zu München, Vol. 7 (1877), 157-187.

%t a[n_] := 2*(4^n-1)/Times @@ Select[Divisors[n]+1, PrimeQ]; Table[a[n], {n, 1, 26}] (* _Jean-François Alcover_, Jul 29 2013 *)

%o (Sage)

%o def A181904(n) :

%o def A027760(n) :

%o S = divisors(n)

%o S = map(lambda i: i+1, S)

%o S = filter(lambda i: is_prime(i), S)

%o return mul(i for i in S)

%o return 2*(4^n-1) / A027760(n)

%o [A181904(n) for n in (1..26)]

%Y Cf. A002446, A027760

%K nonn

%O 1,1

%A _Peter Luschny_, Apr 01 2012

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 25 09:12 EDT 2024. Contains 371966 sequences. (Running on oeis4.)