Sequences
392,541 sequences
- n^5 mod 27.A070611
n^5 mod 27.
- n^5 mod 28.A070612
n^5 mod 28.
- a(n) = n^5 mod 29.A070613
a(n) = n^5 mod 29.
- a(n) = n^5 mod 31.A070614
a(n) = n^5 mod 31.
- Minimal difference between any two digits of n in base 10.A070615
Minimal difference between any two digits of n in base 10.
- a(n) = n^5 mod 33.A070616
a(n) = n^5 mod 33.
- a(n) = n^5 mod 34.A070617
a(n) = n^5 mod 34.
- a(n) = n^5 mod 35.A070618
a(n) = n^5 mod 35.
- a(n) = n^5 mod 36.A070619
a(n) = n^5 mod 36.
- a(n) = n^5 mod 37.A070620
a(n) = n^5 mod 37.
- a(n) = n^5 mod 38.A070621
a(n) = n^5 mod 38.
- a(n) = n^5 mod 39.A070622
a(n) = n^5 mod 39.
- a(n) = n^5 mod 40.A070623
a(n) = n^5 mod 40.
- a(n) = n^5 mod 41.A070624
a(n) = n^5 mod 41.
- a(n) = n^5 mod 42.A070625
a(n) = n^5 mod 42.
- a(n) = n^5 mod 43.A070626
a(n) = n^5 mod 43.
- a(n) = n^5 mod 44.A070627
a(n) = n^5 mod 44.
- a(n) = n^5 mod 45.A070628
a(n) = n^5 mod 45.
- a(n) = n^5 mod 46.A070629
a(n) = n^5 mod 46.
- a(n) = n^5 mod 47.A070630
a(n) = n^5 mod 47.
- a(n) = n^5 mod 48.A070631
a(n) = n^5 mod 48.
- a(n) = (2^(3^n)+1)/3^(n+1).A070632
a(n) = (2^(3^n)+1)/3^(n+1).
- a(n) is the number of k>0 such that phi(k) divides n.A070633
a(n) is the number of k>0 such that phi(k) divides n.
- a(n) = n^6 mod 11.A070634
a(n) = n^6 mod 11.
- a(n) = n mod (sum of digits of n).A070635
a(n) = n mod (sum of digits of n).
- a(n) = n^6 mod 13.A070636
a(n) = n^6 mod 13.
- a(n) = n^6 mod 14.A070637
a(n) = n^6 mod 14.
- Duplicate of A070438.A070638
Duplicate of A070438.
- a(n) = (1/phi(n))*Sum_{k=1..n} phi(n*k).A070639
a(n) = (1/phi(n))*Sum_{k=1..n} phi(n*k).
- a(n) = n^6 mod 17.A070640
a(n) = n^6 mod 17.
- a(n) = n^6 mod 18.A070641
a(n) = n^6 mod 18.
- a(n) = n^6 mod 19.A070642
a(n) = n^6 mod 19.
- Duplicate of A070442.A070643
Duplicate of A070442.
- a(n) = n^6 mod 21.A070644
a(n) = n^6 mod 21.
- a(n) = n^6 mod 22.A070645
a(n) = n^6 mod 22.
- a(n) = n^6 mod 23.A070646
a(n) = n^6 mod 23.
- Largest prime factor of sequence of numbers of the form p*q (p, q distinct primes).A070647
Largest prime factor of sequence of numbers of the form p*q (p, q distinct primes).
- a(n) = n^6 mod 25.A070648
a(n) = n^6 mod 25.
- a(n) = n^6 mod 26.A070649
a(n) = n^6 mod 26.
- a(n) = n^6 mod 27.A070650
a(n) = n^6 mod 27.
- a(n) = n^6 mod 28.A070651
a(n) = n^6 mod 28.
- a(n) = n^6 mod 29.A070652
a(n) = n^6 mod 29.
- Duplicate of A070452.A070653
Duplicate of A070452.
- a(n) = n^6 mod 31.A070654
a(n) = n^6 mod 31.
- Numbers k such that k+1, k^2+1, k^4+1 and k^8+1 are primes.A070655
Numbers k such that k+1, k^2+1, k^4+1 and k^8+1 are primes.
- a(n) = n^6 mod 33.A070656
a(n) = n^6 mod 33.
- a(n) = n^6 mod 34.A070657
a(n) = n^6 mod 34.
- a(n) = n^6 mod 35.A070658
a(n) = n^6 mod 35.
- a(n) = n^6 mod 36.A070659
a(n) = n^6 mod 36.
- a(n) = n^6 mod 37.A070660
a(n) = n^6 mod 37.