The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A290340 Numbers m such that each of the four consecutive integers m, m+1, m+2, m+3 has squarefree rank 1. 2
17, 241, 242, 1249, 4049, 4799, 17297, 120049, 206081, 281249, 388961, 470447, 538721, 1462049, 1566449, 1808801, 1916881, 3302449, 3302450, 3693761, 3959297, 5385761, 5664976, 6118001, 6986321, 9305297, 10479041, 14268481, 16831601, 20110481, 22997761, 27661922, 28140001 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
A162642(k) is the squarefree rank of k.
Numbers that are the first of four consecutive terms of A228056 form a subsequence: 242, 3302450, 22997761, 27661922, 28140001, 64866050, ... consisting of those numbers m in this sequence such that m, m+1, m+2, and m+3 are all composite. - Charles R Greathouse IV, Sep 30 2021
One of for positive integer m, m+1, m+2, m+3 is of the form 4*k + 2 = 2*(2*k + 1). As 2 has an odd exponent the exponents in the prime factorization and 2*k + 1 is odd, the number of odd exponents in the prime factorization of 2*k + 1 must be 0 i.e., 2*k + 1 is a perfect square and so one of m, m+1, m+2, m+3 is of the form 2*t^2 where t is an odd square. - David A. Corneth, Nov 09 2023
LINKS
David A. Corneth, Table of n, a(n) for n = 1..10000 (first 79 terms from Jason Kimberley, a(n) for n = 80..347 from Charles R Greathouse IV)
David A. Corneth, PARI program
EXAMPLE
m = 17 is in the sequence as the number of odd prime exponents of each of the numbers m = 17 through m + 3 = 20 is 1. - David A. Corneth, Nov 06 2023
PROG
(Magma)
A162642:=func<n|&+[Integers()|pe[2]mod 2:pe in Factorisation(n)]>;
c:=func<a|[n:n in a|n+1 in a]>;
c(c(c([n:n in[1..10^6]|A162642(n)eq 1])));
(PARI) list(lim)=my(u=vectorsmall(4), v=List(), s, i); forfactored(n=2, lim\1+3, if(i++>4, i=1); s-=u[i]; s+=u[i]=(vecsum(n[2][, 2]%2)==1); if(s==4, listput(v, n[1]-3))); Vec(v); \\ Charles R Greathouse IV, Sep 30 2021
(PARI) \\ See PARI link
CROSSREFS
Sequence in context: A264455 A142126 A251769 * A103772 A196987 A051560
KEYWORD
nonn
AUTHOR
Jason Kimberley, Jul 27 2017
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 May 20 15:51 EDT 2024. Contains 372717 sequences. (Running on oeis4.)