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!)
A037285 Replace n with concatenation of its nontrivial odd divisors. 5
0, 0, 0, 0, 0, 3, 0, 0, 3, 5, 0, 3, 0, 7, 35, 0, 0, 39, 0, 5, 37, 11, 0, 3, 5, 13, 39, 7, 0, 3515, 0, 0, 311, 17, 57, 39, 0, 19, 313, 5, 0, 3721, 0, 11, 35915, 23, 0, 3, 7, 525, 317, 13, 0, 3927, 511, 7, 319, 29, 0, 3515, 0, 31, 37921, 0, 513, 31133, 0, 17, 323, 5735, 0, 39, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
PROG
(Haskell)
import Data.List (delete)
a037285 n
| a209229 n == 1 = 0
| a010051 n == 1 = 0
| otherwise = read $ concat $ (map show) $ delete n $ tail $ a182469_row n
-- Reinhard Zumkeller, May 01 2012
(Python)
from sympy import divisors
def a(n):
nontrivial_odd_divisors = [d for d in divisors(n)[1:-1] if d%2 == 1]
if len(nontrivial_odd_divisors) == 0: return 0
else: return int("".join(str(d) for d in nontrivial_odd_divisors))
print([a(n) for n in range(1, 70)]) # Michael S. Branicky, Dec 31 2020
CROSSREFS
Sequence in context: A222402 A222522 A091921 * A337981 A341761 A181787
KEYWORD
nonn,base,easy
AUTHOR
EXTENSIONS
More terms from Erich Friedman
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 April 23 14:15 EDT 2024. Contains 371914 sequences. (Running on oeis4.)