Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091856
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091856 Beginning with 1, minimum value such that gcd(a(2n-1),a(2n)) = 1, gcd(a(2n),a(2n+1))>1 and a(n) > a(n-1). +0
2
1, 2, 4, 5, 10, 11, 22, 23, 46, 47, 94, 95, 100, 101, 202, 203, 210, 211, 422, 423, 426, 427, 4, 34, 435, 438, 439, 878, 879, 882, 883, 1766, 1767, 1770, 1771, 1778, 1779, 1782, 1783, 3566, 3567, 3570, 3571, 7142, 7143, 7146, 7147, 7154, 7155, 7158, 7159 (list; graph; listen)
OFFSET

1,2

FORMULA

a(2n) = a(2n-1) + 1, a(2n+1) = a(2n) + LeastPrimeFactor(a(2n)).

CROSSREFS

Cf. A091857, A020639.

Sequence in context: A018339 A128216 A080735 this_sequence A083416 A022770 A141481

Adjacent sequences: A091853 A091854 A091855 this_sequence A091857 A091858 A091859

KEYWORD

easy,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 13 2004

EXTENSIONS

Edited and extended by Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Dec 26 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 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research