|
|
|
|
|
|
|
|
|
#15 by Paul D. Hanna at Mon Feb 18 13:12:13 EST 2013
|
|
|
|
|
|
|
|
#14 by Paul D. Hanna at Mon Feb 18 13:12:08 EST 2013
|
|
| NAME
|
a(n) = A073711(2^n-1) for n>=0.
|
|
| DATA
|
1, 1, 2, 6, 26, 186, 3138, 206850, 91058098, 534571085778, 126075037515248882, 6062019374259400059294162, 470527304983253008023608694415844658, 1285056632958988628362087081869760004715744193806354
|
|
| COMMENTS
|
A073711(2^n) = 1 for n>=0.
|
|
| CROSSREFS
|
Cf. A073711.
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#13 by Paul D. Hanna at Mon Feb 18 12:53:32 EST 2013
|
|
|
|
|
|
|
|
#12 by Paul D. Hanna at Mon Feb 18 12:53:13 EST 2013
|
|
| NAME
|
allocated for Paul D. Hanna
a(n) = A073711(2^n-1) for n>=0.
|
|
| DATA
|
1, 1, 2, 6, 26, 186, 3138, 206850, 91058098, 534571085778, 126075037515248882, 6062019374259400059294162
|
|
| OFFSET
|
0,3
|
|
| COMMENTS
|
A073711(2^n) = 1 for n>=0.
The g.f. G(x) for A073711 satisfies: G(x) = G(x^2) + x*G(x^2)^2.
What is the rate of growth of this sequence?
|
|
| CROSSREFS
|
Cf. A073711.
|
|
| KEYWORD
|
allocated
nonn
|
|
| AUTHOR
|
Paul D. Hanna, Feb 18 2013
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#11 by Paul D. Hanna at Mon Feb 18 12:47:43 EST 2013
|
|
| NAME
|
allocated for Paul D. Hanna
|
|
| KEYWORD
|
recycled
allocated
|
|
|
|
|
|
|
#10 by T. D. Noe at Mon Feb 18 00:09:24 EST 2013
|
|
|
|
|
|
|
|
#9 by T. D. Noe at Mon Feb 18 00:09:18 EST 2013
|
|
| NAME
|
1/(square root of number Of recurring terms)
|
|
| DATA
|
1, 2, 3, 7, 16, 195, 5887, 1267744
|
|
| OFFSET
|
1,2
|
|
| COMMENTS
|
datas are the denominators of u(n)= 1/(u(n-1)+u(n-2))
Limit Is 1/square root of 2
If u(n)=1/(u(n-1)+u(n-2)+u(n-3)), limit Is 1/(square root of 3); and so on.
If Numerator Is different of 1, limit Is not 1/(square root ot number of récurrent terms) but another number maybe intersting to study.
|
|
| FORMULA
|
u(n)= a/(u(n-1)+u(n-2)+ ....)
|
|
| KEYWORD
|
nonn,changed
recycled
|
|
| AUTHOR
|
Alain Brugière, Feb 10 2013
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#8 by Alain Brugière at Sun Feb 17 22:40:31 EST 2013
|
|
|
|
|
|
|
|
#7 by Alain Brugière at Sun Feb 10 09:12:34 EST 2013
|
|
| COMMENTS
|
If u(n)=1/(u(n-1)+u(n-2)+u(n-3)), limit Is 1//(square root of 3 ; ); and so on.
Numerator mayIf beNumerator Is different of 1, limit Is not 1/(square root ot number of récurrent terms) but another number maybe intersting to study.
|
|
|
|
|
Discussion
|
| Sun Feb 17
| 11:02
| OEIS Server: This sequence has not been edited or commented on for a week
yet is not proposed for review. If it is ready for review, please
visit https://oeis.org/draft/A211604 and click the button that reads
"These changes are ready for review by an OEIS Editor."
Thanks.
- The OEIS Server
|
|
| 22:40
| Alain Brugière: Please, erase what I did and unsubscribe me.
|
|
|
|
|
|
|
#6 by Alain Brugière at Sun Feb 10 09:02:08 EST 2013
|
|
| COMMENTS
|
OfIf u(n)=1/(u(n-1)+u(n-2)+u(n-3)), limit Is 1/square root of 3 ; and so on.
|
|
|
|
|
|
