Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A120335
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A120335 CRF(13): consecutive refactorable numbers (rf, rf-1 are refactorable) such that 13 is the smallest prime divisor of rf. +0
1
79600343456925208350554324952070658488321, 67727051825754224132985695308485992267126791150081, 17096333467784942360991864487916588941402614691799041 (list; graph; listen)
OFFSET

1,1

COMMENT

The sequence has prime factorization (13*197)^12, (13*1093)^12, (13*1733)^12, (13*17*139)^12, (13*7877)^12, (13*16069)^12.

FORMULA

a(n) = is the n-th number rf such that both rf and rf-1 are refactorable and 13 is the smallest prime divisor of rf.

EXAMPLE

a(1)=(13*197)^12 is the first number rf such that rf refactorable, 13 is the smallest prime of rf and rf-1 is refactorable.

CROSSREFS

Cf. A033950, A036898, A114617.

Sequence in context: A095474 A003944 A003937 this_sequence A095476 A095478 A095480

Adjacent sequences: A120332 A120333 A120334 this_sequence A120336 A120337 A120338

KEYWORD

nonn,bref

AUTHOR

Walter Kehowski (wkehowski(AT)cox.net), Jun 22 2006

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 December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research