The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A350652 a(n) is where the chosen card needs to be placed in a deck of 2n cards when performing "Persistimis Possessiamo" trick. 0
2, 2, 4, 6, 8, 6, 8, 6, 8, 6, 8, 14, 16, 14, 16, 22, 24, 22, 24, 30, 32, 30, 32, 22, 24, 22, 24, 30, 32, 30, 32, 22, 24, 22, 24, 30, 32, 30, 32, 22, 24, 22, 24, 30, 32, 30, 32, 54, 56, 54, 56, 62, 64, 62, 64, 54, 56, 54, 56, 62, 64, 62, 64, 86, 88, 86, 88, 94, 96, 94, 96 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Consider a deck of cards of size 2n where an ace of spades is placed a(n)-th from the top. Alice deals the deck into two piles, where the first card goes to Bob and the second to herself. Then Bob's pile is discarded and Alice repeats the procedure with her leftover pile until she is left with one card. This card is the ace of spades.
In the standard deck of size 52, the chosen card needs to be placed 22nd. Not coincidentally, the title of the trick has 22 letters.
The placement is the same for the decks of size 2n and 2n+1: this is why the odd-sized decks are discarded from the sequence.
a(n) is always even to guarantee that during the first dealing the card goes back to Alice's pile.
LINKS
FORMULA
a(n) = 2(n+1-a(floor(n/2))), with a(1) = 2.
MATHEMATICA
lis = {2}; Do[lis = Append[lis, 2 (Length[lis] + 2 - lis[[Floor[(Length[lis] + 1)/2]]])], {70}]; lis
CROSSREFS
Sequence in context: A297106 A357877 A299925 * A081488 A199117 A348781
KEYWORD
nonn
AUTHOR
Tanya Khovanova, Jan 09 2022
STATUS
approved

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 June 7 20:29 EDT 2024. Contains 373206 sequences. (Running on oeis4.)