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!)
A094222 a(n+1) = a(n) + (number of distinct prime factors of a(n)) for n>1; a(1)=1, a(2)=2. 3
1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 14, 16, 17, 18, 20, 22, 24, 26, 28, 30, 33, 35, 37, 38, 40, 42, 45, 47, 48, 50, 52, 54, 56, 58, 60, 63, 65, 67, 68, 70, 73, 74, 76, 78, 81, 82, 84, 87, 89, 90, 93, 95, 97, 98, 100, 102, 105, 108, 110, 113, 114, 117, 119, 121, 122, 124 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
MAPLE
A094222 := proc(n)
option remember;
if n <= 2 then
n;
else
procname(n-1)+A001221(procname(n-1)) ;
end if;
end proc:
seq(A094222(n), n=1..30) ; # R. J. Mathar, Jul 09 2016
MATHEMATICA
a[1] = 1; a[2] = 2; a[n_] := a[n] = a[n-1] + PrimeNu[a[n-1]]; Array[a, 66] (* Jean-François Alcover, Sep 13 2016 *)
CROSSREFS
Sequence in context: A112587 A068090 A172121 * A164043 A172248 A082415
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, May 28 2004
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 March 29 05:48 EDT 2024. Contains 371265 sequences. (Running on oeis4.)