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!)
A073783 First differences of composite numbers. 16
2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Also, the highest common factors of pair of successive composite numbers. - Amarnath Murthy, Jan 31 2003
All terms are 1 or 2. Runs of 1's may be of arbitrary lengths, while the lengths of runs of 2's are 1 or 2. - Zak Seidov, Mar 18 2013
LINKS
FORMULA
a(n) = A002808(n+1) - A002808(n).
a(n) = A073784(n) + 1.
EXAMPLE
a(7) = A002808(8) - A002808(7) = 15 - 14 = 1.
MATHEMATICA
c[x_] := FixedPoint[x + PrimePi[#] + 1 &, x]; Differences[c /@ Range[106]] (* Jayanta Basu, Jul 09 2013 *)
PROG
(Haskell)
a073783 n = a073783_list !! (n-1)
a073783_list = zipWith (-) (tail a002808_list) a002808_list
-- Reinhard Zumkeller, Jan 10 2013
(PARI) m=4; forcomposite(n=6, 1e3, print1(n-m", "); m=n) \\ Charles R Greathouse IV, Mar 20 2013
CROSSREFS
a(n) = A136527(n, n+1).
Cf. A073445 (first differences).
Sequence in context: A331104 A270646 A293540 * A134430 A130658 A014695
KEYWORD
easy,nonn
AUTHOR
Lior Manor, Aug 11 2002
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 August 16 04:49 EDT 2024. Contains 375173 sequences. (Running on oeis4.)