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!)
A036818 Number of partitions satisfying (cn(0,5) = 0 and cn(1,5) = cn(4,5)). 1
0, 1, 1, 1, 2, 2, 3, 4, 4, 8, 6, 11, 12, 14, 22, 21, 30, 36, 39, 59, 57, 80, 92, 105, 142, 148, 193, 225, 252, 334, 349, 447, 513, 582, 735, 793, 977, 1126, 1269, 1573, 1702, 2071, 2363, 2673, 3233, 3541, 4221 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

For a given partition cn(i,n) means the number of its parts equal to i modulo n.

Short: (0 := 0 and 1=4).

LINKS

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

MAPLE

c := proc(L, i, n)

    option remember;

    local a, p;

    a := 0 ;

    for p in L do

        if modp(p, n) = i then

            a := a+1 ;

        end if;

    end do:

    a ;

end proc:

A036818 := proc(n)

    local a ;

    a := 0 ;

    for p in combinat[partition](n) do

        if c(p, 0, 5) = 0 then

            if c(p, 1, 5) = c(p, 4, 5) then

                a := a+1 ;

            end if;

        end if;

    end do:

    a ;

end proc:

for n from 1 do

    print(n, A036818(n)) ;

end do: # R. J. Mathar, Oct 19 2014

CROSSREFS

Sequence in context: A342330 A153937 A242971 * A036813 A036814 A137776

Adjacent sequences:  A036815 A036816 A036817 * A036819 A036820 A036821

KEYWORD

nonn

AUTHOR

Olivier Gérard

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 July 28 19:33 EDT 2021. Contains 346335 sequences. (Running on oeis4.)