login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065877 Non-Niven (or non-Harshad) numbers: numbers which are not a multiple of the sum of their digits. 8
11, 13, 14, 15, 16, 17, 19, 22, 23, 25, 26, 28, 29, 31, 32, 33, 34, 35, 37, 38, 39, 41, 43, 44, 46, 47, 49, 51, 52, 53, 55, 56, 57, 58, 59, 61, 62, 64, 65, 66, 67, 68, 69, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 101 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

A188641(a(n)) = 0; A070635(a(n)) > 0. [Reinhard Zumkeller, Apr 07 2011]

LINKS

Harry J. Smith, Table of n, a(n) for n = 1..1000

EXAMPLE

13 is in the list because 13 is not a multiple of 1 + 3 = 4.

MATHEMATICA

Select[Range[101], !IntegerQ[#/Total[IntegerDigits[#]]] &] (* Jayanta Basu, May 05 2013 *)

PROG

(PARI) SumD(x)= { local(s=0); while (x>9, s+=x%10; x\=10); return(s + x) } { n=0; for (m=1, 10^9, if (m%SumD(m), write("b065877.txt", n++, " ", m); if (n==1000, return)) ) } \\ Harry J. Smith, Nov 03 2009

(Haskell)

import Data.List (findIndices)

a065877 n = a065877_list !! (n-1)

a065877_list = map succ $ findIndices (> 0) $ map a070635 [1..]

-- Reinhard Zumkeller, Apr 07 2011

CROSSREFS

Complement of A005349. Cf. A003635, A007953, A065878.

Cf. A188643.

Sequence in context: A043645 A043700 A111634 * A290468 A129917 A102577

Adjacent sequences:  A065874 A065875 A065876 * A065878 A065879 A065880

KEYWORD

base,nonn

AUTHOR

Henry Bottomley, Nov 26 2001

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 16 14:38 EDT 2019. Contains 324152 sequences. (Running on oeis4.)