The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A205883 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A205883

Length of n-th run of A205600(n).
(history; published version)

#18 by T. D. Noe at Tue Jan 22 18:37:44 EST 2013

STATUS

proposed

approved

#17 by Joerg Arndt at Sun Jan 13 03:57:21 EST 2013

STATUS

editing

proposed

#16 by Joerg Arndt at Sun Jan 13 03:57:13 EST 2013

PROG

(PARI) (/* program to get the first 100 terms) : */ v=[1, 2]; L=[2]; for(n=2, 100, v=if(v[n]-2, concat(v, vector(n-1, i, v[i])), concat(concat(v, vector(n-1, i, v[i])), vector(n-1, i, v[i]))); L=concat(L, [length(v)])); a(n)=L[n]

STATUS

proposed

editing

#15 by Michel Marcus at Sun Jan 13 03:52:56 EST 2013

STATUS

editing

proposed

#14 by Michel Marcus at Sun Jan 13 03:52:46 EST 2013

PROG

(PARI) (to got get the first 100 terms) v=[1, 2]; L=[2]; for(n=2, 100, v=if(v[n]-2, concat(v, vector(n-1, i, v[i])), concat(concat(v, vector(n-1, i, v[i])), vector(n-1, i, v[i]))); L=concat(L, [length(v)])); a(n)=L[n]

STATUS

proposed

editing

#13 by Benoit Cloitre at Sun Jan 13 03:35:15 EST 2013

STATUS

editing

proposed

Discussion

Sun Jan 13

03:48

Michel Marcus: to got the first 100 terms -> to get ...

#12 by Benoit Cloitre at Sun Jan 13 03:32:11 EST 2013

PROG

(PARI) (to got the first 100 terms) v=[1, 2]; L=[2]; for(n=2, 100, v=if(v[n]-2, concat(v, vector(n-1, i, v[i])), concat(concat(v, vector(n-1, i, v[i])), vector(n-1, i, v[i]))); L=concat(L, [length(v)])); //a(n)=L[n]

#11 by Joerg Arndt at Sat Jan 12 13:43:45 EST 2013

STATUS

proposed

editing

#10 by Benoit Cloitre at Thu Jan 10 05:12:42 EST 2013

STATUS

editing

proposed

Discussion

Sat Jan 12

13:43

Joerg Arndt: Please fix the Pari code.

#9 by Benoit Cloitre at Thu Jan 10 04:55:29 EST 2013

FORMULA

a(n)=2+sum(k=1,n,A205600(k)*(k-1)). It seems that a(n)=c*n^2+smaller terms with c=0.64...(see graphic provided in the link)