Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063848
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063848 Numbers n such that mu(n) + mu(n+1) + mu(n+2) = 2. +0
1
14, 20, 32, 34, 38, 55, 56, 84, 86, 91, 92, 94, 117, 118, 121, 122, 132, 133, 140, 142, 143, 144, 145, 158, 159, 176, 183, 200, 202, 203, 204, 205, 208, 212, 214, 215, 216, 218, 219, 235, 247, 252, 297, 298, 299, 300, 302, 303, 319, 325, 326, 327, 328, 333 (list; graph; listen)
OFFSET

1,1

PROGRAM

(PARI) m(n) = moebius(n)+moebius(n+1)+moebius(n+2); j=[]; for(n=1, 1000, if(m(n)==2, j=concat(j, n))); j

CROSSREFS

Cf. A063838.

Adjacent sequences: A063845 A063846 A063847 this_sequence A063849 A063850 A063851

Sequence in context: A074851 A087678 A108874 this_sequence A110968 A054017 A129216

KEYWORD

easy,nonn

AUTHOR

Jason Earls (jcearls(AT)cableone.net), Aug 26 2001

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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research