Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A090093
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A090093 a(n) is the smallest composite number coprime to n, n+1, n+2, n+3. +0
4
25, 49, 49, 121, 121, 25, 121, 49, 49, 49, 25, 121, 121, 121, 49, 25, 49, 121, 169, 169, 25, 49, 49, 49, 121, 25, 121, 121, 49, 49, 25, 169, 169, 121, 121, 25, 49, 49, 121, 121, 25, 169, 49, 49, 49, 25, 121, 121, 121, 49, 25, 49, 169, 169, 169, 25, 49, 49, 49, 121, 25 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n)=A053672[n]^2

MATHEMATICA

m=0; Table[fla=1; Do[s=GCD[n, k]; s1=GCD[n, k+1]; s2=GCD[n, k+2]; s3=GCD[n, k+3]; If[Equal[s, 1]&&Equal[s1, 1] &&Equal[s2, 1]&&Equal[s3, 1]&&!PrimeQ[n]&&!Equal[n, 1] &&Equal[fla, 1], m=m+1; Print[n]; fla=0], {n, 1, 1000}], {k, 1, 256}]

CROSSREFS

Cf. A053669-A053674, A090090-A090093.

Sequence in context: A154082 A143278 A106632 this_sequence A004936 A062058 A069063

Adjacent sequences: A090090 A090091 A090092 this_sequence A090094 A090095 A090096

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Nov 26 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research