Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071853
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071853 Numbers n such that for any x, C(2x,x) never has n distinct prime factors. +0
1
11, 38, 51, 70, 84, 92, 107, 147, 155, 167, 279, 310, 326, 354, 377, 403, 469, 475, 489, 534, 588, 607, 619, 669, 685, 687, 710, 783, 805, 820, 848, 898, 947, 1010, 1101, 1207, 1332, 1467, 1481, 1520, 1556, 1578, 1738, 1744, 1796, 1802 (list; graph; listen)
OFFSET

1,1

FORMULA

n such that Card ( x : A067434(x) = n ) = 0

CROSSREFS

Adjacent sequences: A071850 A071851 A071852 this_sequence A071854 A071855 A071856

Sequence in context: A116059 A100842 A057664 this_sequence A072313 A063146 A139276

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 09 2002

EXTENSIONS

More terms from Naohiro Nomoto (n_nomoto(AT)yabumi.com), Jun 16 2002

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 October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research