login
This site is supported by donations to The OEIS 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
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, 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, 8, 7, 17, 7, 12, 8, 19, 12, 11, 7, 20, 9, 17, 5, 17, 10, 12, 15, 18, 5, 21, 7, 12, 10 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

EXAMPLE

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

CROSSREFS

Cf. A086567.

Sequence in context: A177803 A074641 A069003 * A083409 A097454 A139803

Adjacent sequences:  A087852 A087853 A087854 * A087856 A087857 A087858

KEYWORD

nonn

AUTHOR

DELEHAM Philippe (kolotoko(AT)wanadoo.fr)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 21:13 EST 2012. Contains 206085 sequences.