|
|
A033293
|
|
A Connell-like sequence: take 1 number = 1 (mod Q), 2 numbers = 2 (mod Q), 3 numbers = 3 (mod Q), etc., where Q = 8.
|
|
6
|
|
|
1, 2, 10, 11, 19, 27, 28, 36, 44, 52, 53, 61, 69, 77, 85, 86, 94, 102, 110, 118, 126, 127, 135, 143, 151, 159, 167, 175, 176, 184, 192, 200, 208, 216, 224, 232, 233, 241, 249, 257, 265, 273, 281, 289, 297, 298, 306, 314, 322, 330, 338, 346, 354, 362, 370, 371, 379, 387, 395, 403, 411
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
MATHEMATICA
|
row[1] = {1}; row[n_] := row[n] = Table[row[n-1][[-1]] + 8k + 1, {k, 0, n-1}]; Table[row[n], {n, 1, 11}] // Flatten (* Jean-François Alcover, Jan 25 2013 *)
|
|
PROG
|
(Haskell)
a033293 n k = a033293_tabl !! (n-1) !! (k-1)
a033293_row n = a033293_tabl !! (n-1)
a033293_tabl = f 1 [1..] where
f k xs = ys : f (k+1) (dropWhile (<= last ys) xs) where
ys = take k $ filter ((== 0) . (`mod` 8) . (subtract k)) xs
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from jeroen.lahousse(AT)icl.com
|
|
STATUS
|
approved
|
|
|
|