|
|
A033292
|
|
A Connell-like sequence: take 1 number = 1 (mod Q), 2 numbers = 2 (mod Q), 3 numbers = 3 (mod Q), etc., where Q = 3.
|
|
6
|
|
|
1, 2, 5, 6, 9, 12, 13, 16, 19, 22, 23, 26, 29, 32, 35, 36, 39, 42, 45, 48, 51, 52, 55, 58, 61, 64, 67, 70, 71, 74, 77, 80, 83, 86, 89, 92, 93, 96, 99, 102, 105, 108, 111, 114, 117, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 146, 149, 152, 155, 158, 161, 164, 167, 170, 173, 176, 177, 180
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
row[n_] := n*(3*n-1)/2 + Range[1, 3*n+1, 3]; Flatten[ Table[ row[n], {n, 0, 11}]] (* Jean-François Alcover, Aug 03 2012 *)
|
|
PROG
|
(Haskell)
a033292 n k = a033292_tabl !! (n-1) !! (k-1)
a033292_row n = a033292_tabl !! (n-1)
a033292_tabl = f 1 [1..] where
f k xs = ys : f (k+1) (dropWhile (<= last ys) xs) where
ys = take k $ filter ((== 0) . (`mod` 3) . (subtract k)) xs
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from jeroen.lahousse(AT)icl.com
|
|
STATUS
|
approved
|
|
|
|