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!)
A277357 a(1) = 1; for n > 1, a(n) = (2^n-1)*a(n-1) + 1. 1

%I #7 Sep 30 2017 05:57:52

%S 1,4,29,436,13517,851572,108149645,27578159476,14092439492237,

%T 14416565600558452,29510709784343151245,120846356566885204348276,

%U 989852506639356708816728717,16216753616272580960544466570612,531374365744403660334160536119243405

%N a(1) = 1; for n > 1, a(n) = (2^n-1)*a(n-1) + 1.

%F a(n) ~ c * 2^(n*(n+1)/2), where c = 0.3997494420337372941776146353642774...

%t RecurrenceTable[{a[n]==(2^n-1)*a[n-1]+1, a[1]==1}, a, {n, 1, 15}]

%o (PARI) a(n) = if (n==1, 1, (2^n-1)*a(n-1) + 1); \\ _Michel Marcus_, Sep 30 2017

%Y Cf. A123672.

%K nonn

%O 1,2

%A _Vaclav Kotesovec_, Oct 10 2016

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 September 17 15:16 EDT 2024. Contains 375987 sequences. (Running on oeis4.)