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!)
A330531 Lexicographically earliest sequence of distinct positive integers such that the product of two consecutive terms is always divisible by 6. 3
1, 6, 2, 3, 4, 9, 8, 12, 5, 18, 7, 24, 10, 15, 14, 21, 16, 27, 20, 30, 11, 36, 13, 42, 17, 48, 19, 54, 22, 33, 26, 39, 28, 45, 32, 51, 34, 57, 38, 60, 23, 66, 25, 72, 29, 78, 31, 84, 35, 90, 37, 96, 40, 63, 44, 69, 46, 75, 50, 81, 52, 87, 56, 93, 58, 99, 62 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
This sequence is a permutation of the natural numbers with inverse A330577.
Apparently:
- for m > 1, the m-th run of consecutive terms such that gcd(6, a(n)) = 1 or 6 has 4*m-3 terms,
- for m > 1, the m-th run of consecutive terms such that gcd(6, a(n)) = 2 or 3 has 4*m-1 terms.
LINKS
EXAMPLE
The first terms, alongside their product with the next term, are:
n a(n) a(n)*a(n+1)
-- ---- -----------
1 1 6
2 6 12
3 2 6
4 3 12
5 4 36
6 9 72
7 8 96
8 12 60
9 5 90
10 18 126
PROG
(PARI) s=0; v=1; for (n=1, 10 000, print (n " " v); s+=2^v; for (w=1, oo, if (!bittest(s, w) && (v*w)%6==0, v=w; break)))
CROSSREFS
See A330530 for a similar sequence and additional comments.
Cf. A330577 (inverse).
Sequence in context: A094775 A362922 A019662 * A134105 A167509 A011362
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Dec 17 2019
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 24 14:12 EDT 2024. Contains 371960 sequences. (Running on oeis4.)