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!)
A087824 a(n) = number of times n occurs in A087817. 0

%I #11 Dec 27 2023 01:01:00

%S 2,2,3,4,1,5,2,6,3,7,4,1,8,5,2,9,6,3,10,1,7,4,11,2,8,5,12,3,9,6,13,4,

%T 10,7,14,5,11,8,15,1,1,6,12,9,16,2,2,7,13,10,17,3,3,8,14,11,18,4,4,9,

%U 15,12,19,5,5,10,16,13,20,6,1,6,11,17,14,21,7,2,7,12,18,15,22,1,8,3,8,13,19

%N a(n) = number of times n occurs in A087817.

%t Conway[n_Integer?Positive] := Conway[n] =Conway[Conway[Conway[n-1]]] + Conway[n - Conway[n-1]]

%t Conway[1] = Conway[2] = 1

%t a=Table[Conway[n], {n, 1, 3000}];

%t mx=Max[a]

%t c=Table[Count[a, m-1, m], {m, 1, mx}]

%t d=Delete[c, 1]

%Y Cf. A087817.

%K nonn

%O 1,1

%A _Roger L. Bagula_, Oct 06 2003

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 23 22:36 EDT 2024. Contains 371917 sequences. (Running on oeis4.)