Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063838
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063838 Numbers n such that mu(n) + mu(n+1) + mu(n+2) = 3. +0
10
33, 85, 93, 141, 201, 213, 217, 301, 393, 445, 633, 697, 869, 921, 1041, 1137, 1189, 1253, 1261, 1345, 1401, 1589, 1641, 1761, 1793, 1837, 1893, 1937, 1941, 1981, 2045, 2101, 2181, 2189, 2217, 2305, 2361, 2433, 2461, 2469, 2489, 2517, 2561, 2641, 2721 (list; graph; listen)
OFFSET

1,1

REFERENCES

I. Niven and H. S. Zuckerman, An Introduction to the Theory of Numbers. 4th ed., Wiley, NY, 1980, p. 113.

MATHEMATICA

Transpose[ Select[ Partition[ Range[ 3000 ], 3, 1 ], MoebiusMu[ #[ [ 1 ] ] ]+MoebiusMu[ #[ [ 2 ] ] ]+MoebiusMu[ #[ [ 3 ] ] ]==3& ] ][ [ 1 ] ]

PROGRAM

(PARI) M(n) = moebius(n)+moebius(n+1)+moebius(n+2); j=[]; for(n=1, 5000, if(M(n)==3, j=concat(j, n))); j

CROSSREFS

Cf. A008683. A proper subset of A007675.

Sequence in context: A073251 A005238 A052214 this_sequence A075039 A039833 A080700

Adjacent sequences: A063835 A063836 A063837 this_sequence A063839 A063840 A063841

KEYWORD

easy,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Aug 21 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research