OFFSET
1,1
COMMENTS
In case of a tie, round up. - N. J. A. Sloane, Nov 06 2022
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..1000
R. J. Penrose, Puzzle, Twistor Newsletter, No. 10 (July 1980), p. 22.
R. J. Penrose, Puzzle, Twistor Newsletter, No. 10 (July 1980), p. 22. [Cached copy]
R. J. Penrose, Solution to puzzle, Twistor Newsletter, No. 41, p. 37, 1996.
R. J. Penrose, Solution to puzzle, Twistor Newsletter, No. 41, p. 37, 1996. [Cached copy]
Z. Sunic, Tree morphisms, transducers and integer sequences, arXiv:math/0612080 [math.CO], 2006.
MATHEMATICA
A003138[n_]:= With[{m=24*(2^n-1)/n}, If[Floor[m+1/2] -Floor[m]>=1/2, Ceiling[m], Floor[m]]];
Table[A003138[n], {n, 70}] (* G. C. Greubel, Nov 04 2022 *)
PROG
(Magma) [Round(24*(2^n -1)/n): n in [1..70]]; // G. C. Greubel, Nov 04 2022
(SageMath) [round(24*(2^n -1)/n) for n in range(1, 71)] # G. C. Greubel, Nov 04 2022
(PARI) a(n) = round(24*(2^n - 1)/n); \\ Michel Marcus, Nov 05 2022
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved