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!)
A117604 Padovan numbers which can be divided by their multiplicative digital root. 1

%I #4 Mar 31 2012 13:22:27

%S 1,2,3,4,5,7,9,12,616,816,1432,1618192

%N Padovan numbers which can be divided by their multiplicative digital root.

%C a(13), if it exists, is A000931(m) for some m >= 25000, and thus has over 3000 digits. - Nathaniel Johnston, May 05 2011

%Y Cf. A000931, A031347.

%K nonn,base

%O 1,2

%A Luc Stevens (lms022(AT)yahoo.com), Apr 05 2006

%E Offset changed from 0 to 1 and a(12) from _Nathaniel Johnston_, May 05 2011

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 July 26 15:39 EDT 2024. Contains 374635 sequences. (Running on oeis4.)