OFFSET
1,1
COMMENTS
Conjecture: sequence contains arbitrarily long runs of consecutive integers.
First runs with lengths 1..4 are 6; 20, 21; 29, 30, 31; 58, 59, 60, 61.
Records in run lengths are 1, 2, 3, 4, 5, 6, 7, 9, 13, 17, 20, 23, 32, 33, 36, 40, 41, 43, 48, 49, 52, 69, 77, 89, 97, 99, 108, 126, 135, 148, 149
with corresponding first terms of runs: 6, 20, 29, 58, 148, 163, 378, 449, 936, 1675, 5740, 7075, 15915, 35545, 112303, 229944, 469454, 628921, 775480, 902518, 1003826, 1208039, 12542948, 29223210, 33015691, 224430268, 260333109, 530363391, 3713119689, 7962252405, 9312173798.
Conjecture is easy to prove using the Chinese Remainder Theorem and the fact that the gaps between squares grow. - Robert Israel, Jan 25 2018
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
MAPLE
filter:= n -> not issqr(24*n+1) and not isprime(24*n+1):
select(filter, [$1..200]); # Robert Israel, Jan 25 2018
MATHEMATICA
Select[Range[150], !PrimeQ[24#+1]&&!IntegerQ[Sqrt[24#+1]]&] (* Harvey P. Dale, Dec 01 2015 *)
PROG
(PARI) for(n=1, 200, m=24*n+1; if(isprime(m)+issquare(m), , print1(n", ")))
(Magma) [n: n in [1..200] | not IsSquare(24*n+1) and not IsPrime(24*n+1)]; // Vincenzo Librandi, Jan 26 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
Zak Seidov, Dec 15 2011
STATUS
approved