Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087429
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087429 a(n) = if gpf(n) < gpf(n+1) then 1 else 0, where gpf=A006530 (greatest prime-factor). +0
3
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; listen)
OFFSET

1,1

COMMENT

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: A071040 A078387 A105470 this_sequence A093075 A104120 A108336

Adjacent sequences: A087426 A087427 A087428 this_sequence 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

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