The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 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 Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 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 CROSSREFS Cf. A182469, A209229, A010051, A106708, A037283, A037284. Sequence in context: A222402 A222522 A091921 * A181787 A318925 A285213 Adjacent sequences:  A037282 A037283 A037284 * A037286 A037287 A037288 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 16 21:37 EST 2020. Contains 331975 sequences. (Running on oeis4.)