login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60, we have over 367,000 sequences, and we’ve crossed 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A174876 Numbers n such that the sum of squares of their digits > n. 1
2, 3, 4, 5, 6, 7, 8, 9, 14, 15, 16, 17, 18, 19, 25, 26, 27, 28, 29, 36, 37, 38, 39, 46, 47, 48, 49, 56, 57, 58, 59, 66, 67, 68, 69, 76, 77, 78, 79, 85, 86, 87, 88, 89, 94, 95, 96, 97, 98, 99 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The sequence is finite and contains 50 numbers. If n > 99, the sum of squares of digits of n < n.
LINKS
EXAMPLE
56 is in the sequence because 5^2 + 6^2 = 61 > 56.
MAPLE
with(numtheory):k:=0:for n from 1 to 200do:l:=length(n):n0:=n:s:=0:for m from
1 to l do:q:=n0:u:=irem(q, 10):v:=iquo(q, 10):n0:=v :s:=s+u^2:od: if s>n then
k:=k+1:printf(`%d, `, n):else fi:od:print(k):
PROG
(Sage) A174876 = [n for n in IntegerRange(1, 1000) if sum(d**2 for d in n.digits()) > n] # D. S. McNeil, Dec 02 2010
CROSSREFS
Sequence in context: A066310 A342226 A032987 * A092597 A335134 A334918
KEYWORD
nonn,base,fini,full
AUTHOR
Michel Lagneau, Dec 02 2010
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 December 2 04:17 EST 2023. Contains 367506 sequences. (Running on oeis4.)