|
Search: id:A036844
|
|
|
| A036844 |
|
Numbers n such that n / sopfr(n) is an integer, where sopr() = sum-of-prime-factors, A001414. |
|
+0
5
|
|
| 2, 3, 4, 5, 7, 11, 13, 16, 17, 19, 23, 27, 29, 30, 31, 37, 41, 43, 47, 53, 59, 60, 61, 67, 70, 71, 72, 73, 79, 83, 84, 89, 97, 101, 103, 105, 107, 109, 113, 127, 131, 137, 139, 149, 150, 151, 157, 163, 167, 173, 179, 180, 181, 191, 193, 197, 199, 211, 220, 223
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Union of A046346 and the primes. - T. D. Noe, Feb 20 2007
|
|
REFERENCES
|
M. Lal, Iterates of a number-theoretic function, Math. Comp., 23 (1969), 181-183.
Amarnath Murthy, Generalization of Partition function and introducing Smarandache Factor Partition, Smarandache Notions Journal, Vol. 11, 1-2-3, Spring-2000.
J. Roberts, Lure of the Integers, Math. Assoc. America, 1992, p. 89.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
M. L. Perez et al., eds., Smarandache Notions Journal
|
|
EXAMPLE
|
a(12) = 27 because sopfr(27) = 3 + 3 + 3 = 9 and 27 is divisible by 9.
|
|
CROSSREFS
|
sopfr(n) is defined in A001414.
Sequence in context: A055464 A139316 A062972 this_sequence A033070 A046022 A073019
Adjacent sequences: A036841 A036842 A036843 this_sequence A036845 A036846 A036847
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Robert A. Stump (bee_ess107(AT)yahoo.com), Jan 09 2002
|
|
|
Search completed in 0.002 seconds
|
