Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063084
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063084 a(n) = Pi[n-1]*n-Pi[n]*(n-1), where Pi[] = A000720(). +0
1
0, -1, -1, 2, -2, 3, -3, 4, 4, 4, -6, 5, -7, 6, 6, 6, -10, 7, -11, 8, 8, 8, -14, 9, 9, 9, 9, 9, -19, 10, -20, 11, 11, 11, 11, 11, -25, 12, 12, 12, -28, 13, -29, 14, 14, 14, -32, 15, 15, 15, 15, 15, -37, 16, 16, 16, 16, 16, -42, 17, -43, 18, 18, 18, 18, 18, -48, 19, 19, 19, -51, 20, -52, 21, 21, 21, 21, 21, -57, 22, 22, 22, -60, 23, 23 (list; graph; listen)
OFFSET

1,4

REFERENCES

G. A. Kudrevatow, (1970): Exercises in Number Theory. Problem 488; page 56; Prosveshenie, Moscow [in Russian].

EXAMPLE

The function is positive for composite and negative for prime numbers. It is zero at n=1.

CROSSREFS

Cf. A000720, A000027, A010051, A061397, A000040, A002808.

Sequence in context: A132924 A076890 A103358 this_sequence A127079 A080251 A137791

Adjacent sequences: A063081 A063082 A063083 this_sequence A063085 A063086 A063087

KEYWORD

sign

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Aug 06 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 September 5 01:39 EDT 2008. Contains 143414 sequences.


AT&T Labs Research