Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A162900
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A162900 a(1)=1. For n>=2, a(n) = the smallest integer > a(n-1) such that GCD(n,a(n)) = p^k, where p = prime, k >= 1. +0
2
1, 2, 3, 4, 5, 8, 14, 16, 18, 22, 33, 34, 39, 40 (list; graph; listen)
OFFSET

1,2
CROSSREFS

A162901

Sequence in context: A051706 A152526 A162901 this_sequence A140294 A108014 A075721

Adjacent sequences: A162897 A162898 A162899 this_sequence A162901 A162902 A162903

KEYWORD

more,nonn

AUTHOR

Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Jul 16 2009

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 November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.