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!)
A218578 The number of times n occurs in A095972. 2
2, 1, 3, 1, 1, 3, 2, 0, 2, 2, 2, 1, 2, 1, 3, 1, 2, 0, 4, 0, 2, 2, 1, 2, 0, 2, 2, 1, 3, 1, 2, 1, 2, 3, 0, 1, 2, 2, 1, 1, 2, 1, 2, 0, 3, 1, 2, 1, 2, 0, 4, 1, 2, 3, 2, 0, 2, 1, 2, 0, 2, 1, 0, 2, 0, 3, 3, 0, 4, 1, 2, 0, 2, 1, 3, 2, 0, 0, 3, 1, 0, 3, 2, 3, 0, 1, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

Alternative definition: a(n) = number of k such that A000224(k) = k - n.

LINKS

T. D. Noe, Table of n, a(n) for n = 0..10000

EXAMPLE

a(0) is 2, because 0 occurs only twice in A095972. a(1) is 1, because 1 occurs only once in A095972.

MAPLE

A218578 := proc(n)

    local f;

    f := 0 ;

    for q from 1 to 2*n+2 do

        if A095972(q) = n then

            f := f+1 ;

        end if;

    end do:

    f ;

end proc: # R. J. Mathar, Nov 05 2012

MATHEMATICA

nn = 100; t = Table[Length[Complement[Range[n-1], Union[Mod[Range[n]^2, n]]]], {n, 2*nn + 2}]; Table[Count[t, n], {n, 0, nn}] (* T. D. Noe, Nov 06 2012 *)

CROSSREFS

Cf. A000224, A095972, A218620 (greedy inverse).

Sequence in context: A186007 A212623 A229214 * A006346 A244740 A088742

Adjacent sequences:  A218575 A218576 A218577 * A218579 A218580 A218581

KEYWORD

nonn

AUTHOR

Dmitri Kamenetsky, Nov 03 2012

STATUS

approved

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 April 14 19:50 EDT 2021. Contains 342954 sequences. (Running on oeis4.)