login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087855 a(n) = number of values k such that A086567(k) = n. 1

%I

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

%T 5,5,5,10,7,11,6,10,6,8,4,5,7,7,7,14,6,10,8,19,10,8,5,11,8,11,9,14,9,

%U 8,7,17,7,12,8,19,12,11,7,20,9,17,5,17,10,12,15,18,5,21,7,12,10

%N a(n) = number of values k such that A086567(k) = n.

%e a(15) = 3 because A086567(k) = 15 for k = 37; 49; 57.

%Y Cf. A086567.

%K nonn

%O 1,5

%A _Philippe Deléham_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 21 17:37 EDT 2021. Contains 348155 sequences. (Running on oeis4.)