Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085067
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A085067 a(1) = 6, a(n) = smallest number of the form k*a(n-1) +1 with the same number of divisors i.e. 4. +0
1
6, 55, 111, 334, 335, 671, 1343, 16117, 16118, 64473, 64474, 257897, 2063177, 8252709, 41263546, 123790639, 371371918, 1485487673, 2970975347, 59419506941, 356517041647, 5704272666353, 11408545332707, 262396542652262 (list; graph; listen)
OFFSET

1,1

COMMENT

Though the initial terms match, this sequence differs from A085066, in that the terms can be of two prime signatures i.e. p*q and p^3 such that tau(p*q) = tau(p^3) = 4.

MATHEMATICA

v = 6; Print[v]; Do[k = 1; While[DivisorSigma[0, k*v + 1] != 4, k++ ]; v = k*v + 1; Print[v], {n, 2, 30}] (Propper)

CROSSREFS

Cf. A085066.

Sequence in context: A119220 A119218 A085066 this_sequence A069508 A079465 A061792

Adjacent sequences: A085064 A085065 A085066 this_sequence A085068 A085069 A085070

KEYWORD

nonn

AUTHOR

Amarnath Murthy and Meenakshi Srikanth (amarnath_murthy(AT)yahoo.com), Jun 29 2003

EXTENSIONS

Corrected and extended by Ryan Propper (rpropper(AT)stanford.edu), Aug 29 2005

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research