Sequences
392,541 sequences
- a(0) = 0; for n > 0, a(n) = (fecundity of n) + 1.A070561
a(0) = 0; for n > 0, a(n) = (fecundity of n) + 1.
- Fecundity of n.A070562
Fecundity of n.
- a(n) = 0 if 3 divides the Ramanujan number tau(n) (A000594(n)), otherwise 1.A070563
a(n) = 0 if 3 divides the Ramanujan number tau(n) (A000594(n)), otherwise 1.
- Partial sums of A070563.A070564
Partial sums of A070563.
- n - product of digits of n.A070565
n - product of digits of n.
- "Compact" numbers: see reference for definition.A070566
"Compact" numbers: see reference for definition.
- a(n) = n^4 mod 24.A070567
a(n) = n^4 mod 24.
- a(n) = n^4 mod 25.A070568
a(n) = n^4 mod 25.
- a(n) = n^4 mod 26.A070569
a(n) = n^4 mod 26.
- a(n) = n^4 mod 27.A070570
a(n) = n^4 mod 27.
- a(n) = n^4 mod 28.A070571
a(n) = n^4 mod 28.
- a(n) = n^4 mod 29.A070572
a(n) = n^4 mod 29.
- a(n) = n^4 mod 30.A070573
a(n) = n^4 mod 30.
- a(n) = n^4 mod 31.A070574
a(n) = n^4 mod 31.
- a(n) = n^4 mod 32.A070575
a(n) = n^4 mod 32.
- a(n) = n^4 mod 33.A070576
a(n) = n^4 mod 33.
- a(n) = n^4 mod 34.A070577
a(n) = n^4 mod 34.
- a(n) = n^4 mod 35.A070578
a(n) = n^4 mod 35.
- a(n) = n^4 mod 36.A070579
a(n) = n^4 mod 36.
- a(n) = n^4 mod 37.A070580
a(n) = n^4 mod 37.
- a(n) = n^4 mod 38.A070581
a(n) = n^4 mod 38.
- a(n) = n^4 mod 39.A070582
a(n) = n^4 mod 39.
- a(n) = n^4 mod 40.A070583
a(n) = n^4 mod 40.
- a(n) = n^4 mod 41.A070584
a(n) = n^4 mod 41.
- a(n) = n^4 mod 42.A070585
a(n) = n^4 mod 42.
- a(n) = n^4 mod 43.A070586
a(n) = n^4 mod 43.
- a(n) = n^4 mod 44.A070587
a(n) = n^4 mod 44.
- a(n) = n^4 mod 45.A070588
a(n) = n^4 mod 45.
- a(n) = n^4 mod 46.A070589
a(n) = n^4 mod 46.
- a(n) = n^4 mod 47.A070590
a(n) = n^4 mod 47.
- a(n) = n^4 mod 48.A070591
a(n) = n^4 mod 48.
- Largest prime factor of the n-th Fermat number F(n) = 2^(2^n) + 1.A070592
Largest prime factor of the n-th Fermat number F(n) = 2^(2^n) + 1.
- a(n) = n^5 mod 7.A070593
a(n) = n^5 mod 7.
- Numbers in A070938 that set a new record for digital sums and ending digits.A070594
Numbers in A070938 that set a new record for digital sums and ending digits.
- a(n) = n^5 mod 9.A070595
a(n) = n^5 mod 9.
- n^5 mod 11.A070596
n^5 mod 11.
- Duplicate of A070474.A070597
Duplicate of A070474.
- n^5 mod 13.A070598
n^5 mod 13.
- n^5 mod 14.A070599
n^5 mod 14.
- Largest number with n prime factors where all factors are less than or equal to n.A070600
Largest number with n prime factors where all factors are less than or equal to n.
- n^5 mod 17.A070601
n^5 mod 17.
- n^5 mod 18.A070602
n^5 mod 18.
- a(n) = n^5 mod 19.A070603
a(n) = n^5 mod 19.
- n^5 mod 20.A070604
n^5 mod 20.
- n^5 mod 21.A070605
n^5 mod 21.
- n^5 mod 22.A070606
n^5 mod 22.
- a(n) = n^5 mod 23.A070607
a(n) = n^5 mod 23.
- Duplicate of A070486.A070608
Duplicate of A070486.
- a(n) = n^5 mod 25.A070609
a(n) = n^5 mod 25.
- Number of positive integers k such that sigma(k) divides sigma(n).A070610
Number of positive integers k such that sigma(k) divides sigma(n).