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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A323825 Number of ways of having a total of n coins in your two pockets (each of them either a penny, a nickel, a dime, or a quarter), so that the amounts in the pockets are identical. 1

%I #9 Feb 01 2019 12:01:07

%S 1,0,4,2,12,12,34,40,85,108,190,250,394,516,762,984,1385,1764,2396,

%T 2998,3966,4886,6316,7684,9739,11706,14594,17358,21320,25134,30470,

%U 35618,42697,49532,58770,67724,79622,91172,106326,121048,140117,158692,182452,205624

%N Number of ways of having a total of n coins in your two pockets (each of them either a penny, a nickel, a dime, or a quarter), so that the amounts in the pockets are identical.

%H Alois P. Heinz, <a href="/A323825/b323825.txt">Table of n, a(n) for n = 0..10000</a>

%H Shalosh B. Ekhad and Doron Zeilberger, <a href="https://arxiv.org/abs/1901.08172">In How many ways can I carry a total of n coins in my two pockets, and have the same amount in both pockets?</a>, arXiv:1901.08172 [math.CO], 2019.

%F Ekhad-Zeilberger (2019) gives a g.f.

%K nonn,easy

%O 0,3

%A _N. J. A. Sloane_, Feb 01 2019

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)