Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075154
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A075154 a(n) is the smallest multiple of n such that a(n) mod 100 = n and S(n)=n where S(n) is the sum of the base ten digits of n, or 0 if no such a(n) exists. +0
1
1, 2, 3, 4, 5, 6, 7, 8, 9, 910, 0, 912, 11713, 6314, 915, 3616, 15317, 918, 17119, 9920, 18921, 9922, 82823, 19824, 9925, 46826, 18927, 18928, 78329, 99930, 585931, 388832, 1098933, 198934, 289835, 99936, 99937, 478838, 198939, 1999840 (list; graph; listen)
OFFSET

1,2

REFERENCES

Sandro Boscaro, Nivenmorphic Integers, Journal of Recreational Mathematics, Vol. 28 (1996-97), Number 3, Pag. 201-205.

LINKS

Matthew M. Conroy, Home page (listed instead of email address)

Index entries for sequences related to automorphic numbers

EXAMPLE

a(10)=910 since 10 divides 910, 9+1+0=10 and 910 ends with 10.

CROSSREFS

Cf. A005349.

Adjacent sequences: A075151 A075152 A075153 this_sequence A075155 A075156 A075157

Sequence in context: A069747 A124107 A112014 this_sequence A070938 A070594 A121939

KEYWORD

nonn,base

AUTHOR

Sandro Boscaro (sboscaro(AT)libero.it), Sep 06 2002

EXTENSIONS

Edited by Matthew M. Conroy, Oct 21 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research