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!)
A346461 a(n) = 2^A042965(n+1). 3
2, 8, 16, 32, 128, 256, 512, 2048, 4096, 8192, 32768, 65536, 131072, 524288, 1048576, 2097152, 8388608, 16777216, 33554432, 134217728, 268435456, 536870912, 2147483648, 4294967296, 8589934592, 34359738368, 68719476736, 137438953472, 549755813888, 1099511627776 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
For each n, all positive integers cannot be colored with two colors without any positive integer x being the same color as 4*x or a(n)*x.
A346459(a(n), 4) = 1 for all n > 1.
{a(n)} is the fourth row in A346460.
LINKS
FORMULA
a(n) = 2^(floor((4*n+1)/3)).
a(n) = a(n-1) * a(n-3) / a(n-4) for n > 4.
From Stefano Spezia, Sep 04 2021: (Start)
G.f.: 2*x*(1 + 4*x + 8*x^2)/(1 - 16*x^3).
a(n) = 16*a(n-3) for n > 3. (End)
EXAMPLE
All positive integers cannot be colored with two colors without any positive integer x being the same color as a(1)*x = 2*x or 4*x, since at least two elements of the set {2, 4, 8} have to be the same color, which violates the condition.
MATHEMATICA
Rest@ CoefficientList[Series[2 x (1 + 4 x + 8 x^2)/(1 - 16 x^3), {x, 0, 30}], x] (* Michael De Vlieger, Oct 12 2021 *)
PROG
(PARI) A346461(n) = (1<<((4*(1+n)-3)\3)); \\ Antti Karttunen, Nov 11 2021
(Python)
print([2 ** ((4 * n + 1) // 3) for n in range(1, 31)])
CROSSREFS
Sequence in context: A077666 A232358 A212318 * A232392 A176143 A296946
KEYWORD
nonn,easy
AUTHOR
M. Eren Kesim, Sep 04 2021
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 15:20 EDT 2024. Contains 371916 sequences. (Running on oeis4.)