This site is supported by donations to The OEIS Foundation.

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A111397 Composite numbers (modulo 3). 1
 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 1, 2, 0, 1, 0, 2, 0, 1, 2, 0, 2, 0, 1, 0, 2, 0, 1, 0, 1, 2, 0, 1, 0, 1, 2, 0, 1, 0, 2, 0, 1, 2, 0, 2, 0, 1, 0, 2, 0, 1, 2, 0, 2, 0, 1, 0, 1, 2, 0, 1, 0, 1, 2, 0, 1, 2, 0, 2, 0, 1, 0, 2, 0, 1, 0, 2, 0, 1, 0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 2, 0, 1, 0, 1, 2, 0, 1, 0, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS If you interpret this as a base 3 number then read as a decimal it would equal 0.4124999703972179190135867434954940067125524729635148630103267345... whose continued fraction expansion is 0,2,2,2,1,4,5278,131,4,2,2,2,2,1,24,12,1,1,7,552,1,2,1,...,. with increasing partial quotients 2,4,5278,66292,274715,420778,625399,... LINKS FORMULA a(n) == A002808(n) (mod 3). MATHEMATICA Composite[n_] := FixedPoint[n + PrimePi[ # ] + 1 &, n]; Table[ Mod[Composite[n], 3], {n, 105}] CROSSREFS Cf. A073867. Sequence in context: A035177 A194591 A070105 * A131743 A147648 A113686 Adjacent sequences:  A111394 A111395 A111396 * A111398 A111399 A111400 KEYWORD nonn AUTHOR Robert G. Wilson v, Nov 11 2005 STATUS approved

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

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