Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092984
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A092984 Least k >1 such that n! + k is square-free. +0
2
1, 1, 1, 2, 2, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; listen)
OFFSET

1,4

COMMENT

Conjecture: There exists a finite k such that a(n) < k for all n. Subsidiary sequence: Indices of the first occurrence of n in this sequence. In case the conjecture is true, this sequence would be finite.

If a(n)=2 ==> n!+1 is divisible by a square (sequence A064237) - Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Mar 29 2004

FORMULA

A092983(n)-n!.

EXAMPLE

a(5) = 2 = 122-120.

PROGRAM

(PARI) a(n)=for(i=1, n!, if(issquarefree(n!+i), return(i)))

CROSSREFS

Cf. A092983.

Cf. A064237.

Sequence in context: A152723 A137454 A030613 this_sequence A086600 A025912 A029441

Adjacent sequences: A092981 A092982 A092983 this_sequence A092985 A092986 A092987

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 28 2004

EXTENSIONS

More terms from Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Mar 29 2004

More terms from David Wasserman (dwasserm(AT)earthlink.net), Sep 27 2006

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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research