A054078 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A054078

Number of k<=n such that a(k)>n, where a is the permutation A054076 of N.

0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 2, 1, 1, 0, 1, 2, 1, 2, 1, 0, 1, 2, 1, 2, 1, 0, 0, 1, 2, 2, 2, 2, 1, 1, 0, 1, 2, 2, 2, 2, 1, 2, 1, 0, 1, 2, 2, 3, 2, 2, 2, 2, 1, 0, 1, 2, 2, 3, 2, 2, 3, 2, 2, 1, 0, 1, 2, 2, 3, 2, 2, 3, 2, 2, 1, 0, 0, 1, 2, 2, 3, 3, 3, 3, 3, 3, 2, 1, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,12

LINKS

Table of n, a(n) for n=1..90.

CROSSREFS

Sequence in context: A116375 A301343 A353446 * A029400 A370173 A344612

Adjacent sequences: A054075 A054076 A054077 * A054079 A054080 A054081

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved