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

%I #9 Dec 18 2022 02:31:48

%S 2,1,3,2,3,3,2,3,4,3,4,5,4,5,2,5,5,6,3,2,5,6,7,4,3,6,7,8,5,4,2,6,8,9,

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

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

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

%t Mallows[n_Integer?Positive] := Mallows[n] =Mallows[Mallows[Mallows[n-2]] ]+ Mallows[n - Mallows[n-2]]

%t Mallows[1] = Mallows[2] = 1

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

%t mx=Max[a]

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

%t d=Delete[c, 1]

%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 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)