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!)
A121600 a(n) = number of earlier terms which are not divisible by the largest prime dividing n, for n >= 2, with a(1) = 1. 1
1, 1, 2, 2, 4, 5, 6, 3, 6, 8, 10, 8, 12, 13, 12, 5, 16, 12, 18, 16, 20, 21, 22, 15, 19, 24, 16, 26, 28, 24, 30, 9, 31, 33, 32, 21, 36, 36, 36, 33, 40, 38, 42, 40, 36, 45, 46, 25, 44, 39, 50, 48, 52, 29, 50, 51, 54, 56, 58, 47, 60, 60, 57, 21, 60, 61, 66, 66, 67, 63, 70, 37, 72, 72 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(p) = p - 1 for p prime. - Petros Hadjicostas, May 11 2020
EXAMPLE
3 is the largest prime dividing 12. Among the first 11 terms of the sequence there are 8 terms (1, 1, 2, 2, 4, 5, 8, 10) that are not divisible by 3. So a(12) = 8.
MATHEMATICA
f[s_] := Append[s, Length@ Select[s, Mod[ #, FactorInteger[1 + Length@s] [[ -1, 1]]] != 0 &]]; Nest[f, {1}, 76] (* Robert G. Wilson v *)
PROG
(PARI) {m=75; print1(a=1, ", "); v=[a]; for(n=2, m, f=factor(n); p=f[matsize(f)[1], 1]; a=0; for(j=1, n-1, if(v[j]%p>0, a++)); print1(a, ", "); v=concat(v, a))} \\ Klaus Brockhaus, Aug 15 2006
CROSSREFS
Sequence in context: A208096 A049269 A085085 * A126870 A364049 A368866
KEYWORD
nonn
AUTHOR
Leroy Quet, Aug 09 2006
EXTENSIONS
More terms from Klaus Brockhaus and Robert G. Wilson v, Aug 15 2006
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 18 22:56 EDT 2024. Contains 370952 sequences. (Running on oeis4.)