login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087429 a(n) = if gpf(n) < gpf(n+1) then 1 else 0, where gpf=A006530 (greatest prime-factor). 2
1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Equivalently, a(n) = 1 iff A061395(n+1) > A061395(n), otherwise a(n) = 0. - Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Jan 03 2008

a(n) = A057427(1+A057427(A070221(n)));

for primes p: a(p-1)=1 and a(p)=0;

a(A070089(n)) = 1, a(A070087(n)) = 0, a(A087430(n)) = 0.

MATHEMATICA

Join[{1}, Table[If[PrimePi[FactorInteger[n + 1][[ -1, 1]]] > PrimePi[FactorInteger[n][[ -1, 1]]], 1, 0], {n, 2, 90}]] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jan 06 2008

CROSSREFS

Cf. A061395.

Sequence in context: A163805 A078387 A105470 * A093075 A104120 A108336

Adjacent sequences:  A087426 A087427 A087428 * A087430 A087431 A087432

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Sep 02 2003

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Jul 01 2008, at the suggestion of R. J. Mathar

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 19:37 EST 2012. Contains 205663 sequences.