login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A271418 Define a sequence by b(1) = n, b(m) = b(m-1) + b(m-1)/A052126(m) + 1; then a(n) is the least m such that b(m) belongs to A270807. 2
1, 3, 1, 2, 1, 2, 1, 2, 1, 2, 2, 3, 1, 3, 1, 2, 2, 2, 1, 2, 1, 2, 2, 2, 1, 3, 2, 2, 2, 2, 1, 4, 1, 2, 3, 4, 1, 3, 1, 4, 2, 4, 1, 4, 1, 4, 4, 4, 3, 2, 2, 3, 2, 2, 1, 4, 2, 2, 2, 2, 1, 4, 1, 3, 3, 2, 3, 2, 2, 3, 2, 3, 1, 4, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
the sequence where b(1) = 2 is 2, 4, 7, 9, 13, 15, ...
7 is shared with A270807
there are 3 terms in 2, 4, 7; a(2) = 3
MATHEMATICA
f[n_] := n + n/FactorInteger[n][[-1, 1]] + 1; s = NestList[f, 1, 10^2]; Table[Length@ NestWhileList[f, n, ! MemberQ[s, #] &], {n, 120}] (* Michael De Vlieger, Apr 08 2016 *)
CROSSREFS
Sequence in context: A319658 A276988 A084642 * A230500 A010281 A353361
KEYWORD
nonn,look,hear
AUTHOR
Cody M. Haderlie, Apr 06 2016
EXTENSIONS
a(75) corrected by Chai Wah Wu, Apr 06 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 08:20 EDT 2024. Contains 371964 sequences. (Running on oeis4.)