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!)
A333862 a(n) is the greatest nim-power of n. 1
1, 1, 3, 3, 15, 15, 15, 15, 14, 15, 14, 15, 15, 14, 14, 15, 252, 252, 255, 255, 252, 252, 255, 255, 252, 252, 255, 255, 255, 255, 252, 252, 255, 255, 255, 255, 252, 255, 252, 255, 255, 255, 255, 255, 255, 252, 255, 252, 255, 252, 252, 255, 255, 255, 255, 255 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
For any n >= 0, a(n) is the greatest term in n-th row of A335162.
LINKS
Rémy Sigrist, C program for A333862
EXAMPLE
For n = 10:
- the first nim-powers of 10 are: 1, 10, 14, 13, 8, 1, ...
- so a(10) = 14.
PROG
(C) See Links section.
CROSSREFS
Cf. A335162.
Sequence in context: A281421 A280840 A212200 * A172087 A086116 A100735
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Jun 13 2020
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 April 23 23:26 EDT 2024. Contains 371917 sequences. (Running on oeis4.)