|
Search: id:A071821
|
|
|
| A071821 |
|
Largest prime factor of n is of the form 4k+1. |
|
+0
1
|
|
| 5, 10, 13, 15, 17, 20, 25, 26, 29, 30, 34, 37, 39, 40, 41, 45, 50, 51, 52, 53, 58, 60, 61, 65, 68, 73, 74, 75, 78, 80, 82, 85, 87, 89, 90, 91, 97, 100, 101, 102, 104, 106, 109, 111, 113, 116, 117, 119, 120, 122, 123, 125, 130, 135, 136, 137, 143, 145, 146, 148, 149
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Subsequence of A009003. [From M. F. Hasler (MHasler(AT)univ-ag.fr), Feb 06 2009]
|
|
FORMULA
|
n such that A006530(n) == 1 mod(4)
|
|
PROGRAM
|
(PARI) for(n=2, 200, if((component(component(factor(n), 1), omega(n))-1)%4==0, print1(n, ", ")))
(PARI) for( n=2, 99, vecmax(factor(n)[, 1])%4==1 & print1(n", ")) [From M. F. Hasler (MHasler(AT)univ-ag.fr), Feb 06 2009]
|
|
CROSSREFS
|
Cf. A004431, A009000, A073503, A083025. [From M. F. Hasler (MHasler(AT)univ-ag.fr), Feb 06 2009]
Sequence in context: A009000 A057100 A009003 this_sequence A084645 A092604 A050127
Adjacent sequences: A071818 A071819 A071820 this_sequence A071822 A071823 A071824
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 07 2002
|
|
|
Search completed in 0.002 seconds
|
