Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066682
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066682 Indices of badly sieved numbers: a(n) = if n=A066680(k) then k else 0. +0
3
0, 1, 2, 0, 3, 0, 4, 5, 0, 0, 6, 7, 8, 0, 0, 0, 9, 10, 11, 0, 0, 0, 12, 0, 0, 0, 13, 0, 14, 15, 16, 0, 0, 0, 0, 0, 17, 0, 0, 0, 18, 0, 19, 0, 20, 0, 21, 0, 0, 22, 0, 0, 23, 0, 0, 0, 0, 0, 24, 0, 25, 0, 26, 0, 0, 0, 27, 0, 0, 28, 29, 0, 30, 0, 31, 0, 0, 0, 32 (list; graph; listen)
OFFSET

1,3

COMMENT

a(n) = A099104(n)*A066683(n).

CROSSREFS

Cf. A066680, A049084.

Adjacent sequences: A066679 A066680 A066681 this_sequence A066683 A066684 A066685

Sequence in context: A008800 A008808 A008820 this_sequence A049641 A035363 A079977

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Dec 31, 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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research