OFFSET
1,2
COMMENTS
No string of 9 successive terms can be consecutive integers simply because one of the sums of pair of terms would be a multiple of 9=3^2.
Conjecture: There are infinitely many strings of 8 terms of the form k, k+1, k+2, ..., k+7.
Possible subsidiary sequences: Start of the strings of 8 consecutive natural numbers. Start of the strings of r consecutive natural numbers for a particular r, 3 < r < 8.
A self-inverse permutation of the natural numbers.
LINKS
PROG
(Haskell)
import Data.List (find, delete)
import Data.Maybe (fromJust)
a077223 n = a077223_list !! (n-1)
a077223_list = 1 : g 1 [2..] where
g i xs = x : g x (delete x xs) where
x = (fromJust $ find isOddSquarefree $ map (+ i)
isOddSquarefree m = odd m && a008966 m == 1
for_bFile = take 10000 a077223_list
CROSSREFS
KEYWORD
nice,nonn
AUTHOR
Amarnath Murthy, Nov 03 2002
EXTENSIONS
a(16)-a(71) from Donovan Johnson, Nov 17 2008
STATUS
approved