Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076476
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076476 Fractions a(n)/n are such that gcd(a(n),n)=1, a(n) > 0 and a(n) is as small as possible so that the partial sums of the fractions have prime numerator. Let a(1)=1. +0
2
1, 1, 1, 3, 1, 1, 1, 3, 4, 1, 5, 1, 1, 3, 1, 9, 1, 7, 4, 3, 1, 5, 1, 23, 9, 3, 10, 13, 13, 29, 7, 19, 5, 21, 2, 17, 2, 3, 7, 7, 5, 5, 6, 7, 1, 43, 3, 59, 27, 17, 4, 5, 9, 7, 1, 9, 2, 9, 7, 29, 8, 9, 4, 25, 3, 119, 2, 27, 4, 29, 4, 37, 5, 3, 2, 5, 9, 7, 10, 49, 1, 35, 12, 11, 6, 1, 22, 1, 13, 11, 4 (list; graph; listen)
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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research