Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130638
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130638 a(n) = 1 iff d(n) = d(n+1), otherwise a(n)=0; where d(n) is the number of divisors of natural number. +0
1
0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

Table[If[Length[Divisors[n]] == Length[Divisors[n + 1]], 1, 0], {n, 1, 80}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Aug 12 2007

CROSSREFS

Sequence in context: A063524 A084928 A033683 this_sequence A030217 A030215 A098108

Adjacent sequences: A130635 A130636 A130637 this_sequence A130639 A130640 A130641

KEYWORD

nonn

AUTHOR

Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Aug 11 2007

EXTENSIONS

Corrected and extended by Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Aug 12 2007

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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research