Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137795
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137795 Smallest positive m such that m*n is free of prime gaps in canonical factorization. +0
2
1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 15, 1, 1, 1, 1, 1, 3, 5, 105, 1, 1, 1, 1155, 1, 15, 1, 1, 1, 1, 35, 15015, 1, 1, 1, 255255, 385, 3, 1, 5, 1, 105, 1, 4849845, 1, 1, 1, 3, 5005, 1155, 1, 1, 7, 15, 85085, 111546435, 1, 1, 1, 3234846615, 5, 1, 77, 35, 1, 15015, 1616615, 3, 1, 1 (list; graph; listen)
OFFSET

1,10

COMMENT

A073490(n*a(n)) = 0, A137794(n*a(n)) = 1;

for m < a(n): A073490(n*m) > 0 and A137794(n*m) = 0;

a(A073491(n)) = 1; a(A073492(n) > 1.

EXAMPLE

n=42: A073490(42) = A073490([2*3]*[7]) = 1,

the gap is filled by a(42) = 5: A073490(42*5) = 0.

CROSSREFS

Sequence in context: A064085 A121585 A010278 this_sequence A070989 A066827 A016467

Adjacent sequences: A137792 A137793 A137794 this_sequence A137796 A137797 A137798

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Feb 11 2008

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 7 23:08 EDT 2008. Contains 143486 sequences.


AT&T Labs Research